Solving the maximum subsequence problem with a hardware agents-based system
International Conference on Circuits(2006)
摘要
The maximum subsequence problem is widely encountered in various digital processing systems. Given a stream of both positive and negative integers, it consists of determining the subsequence of maximal sum inside the input stream. In its two-dimensional version, the input is an array of both positive and negative integers, and the problem consists of determining the sub-array of maximal sum inside the input array. These problems are solved by Kadane's algorithm, which has already been proved to be optimal. However, the hardware implementation presented in this paper is based on the hardware agents' paradigm and offers a significantly improved performance (in terms of speed) over the classical software implementations.
更多查看译文
关键词
maximal sum,negative integer,input array,input stream,hardware agent,hardware implementation,maximum subsequence problem,classical software implementation,improved performance,two-dimensional version,hardware agents-based system
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络