Efficient Algorithms for the Maximum Convex Sum Problem
This research is designed to develop and investigate newly defined problems: the Maximum Convex Sum (MCS), and its generalisation, the K-Maximum Convex Sum (K-MCS), in a two-dimensional (2D) array based on dynamic programming. The study centres on the concept of finding the most useful informative a...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
University of Canterbury. Computer Science and Software Engineering
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10092/9347 |