Now showing items 1-2 of 2
Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem
(University of Canterbury. Computer Science and Software Engineering, 2007)
The maximum subarray problem (MSP) involves selection of a segment of consecutive array elements that has the largest possible sum over all other segments in a given array. The efficient algorithms for the MSP and related ...
Fusing Loopless Algorithms for Combinatorial Generation
(University of Canterbury. Computer Science and Software Engineering, 2006)
Loopless algorithms are an interesting challenge in the field of combinatorial generation. These algorithms must generate each combinatorial object from its predecessor in no more than a constant number of instructions, ...