The analysis of algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
The Power of Dominance Relations in Branch-and-Bound Algorithms
Journal of the ACM (JACM)
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Dynamic Programming
DPSKEL: a skeleton based tool for parallel dynamic programming
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Skeletal based programming for dynamic programming on MultiGPU systems
The Journal of Supercomputing
Dynamic load balancing on heterogeneous multi-GPU systems
Computers and Electrical Engineering
| Hi-index | 0.00 |
A new model for dynamic programming and branch and bound algorithms is presented. The model views these algorithms as utilizing computationally feasible dominance relations to infer the orderings of application objects, thereby implicitly enumerating a finite solution space. The formalism is broad enough to apply the computational strategies of dynamic programming and branch and bound to problems with nonassociative objects, and can model both oblivious and nonoblivious algorithms, as well as parallel algorithms. The model is used to classify computations based, in part, on the types of computationally feasible dominances that they employ. It is demonstrated that the model is computationally precise enough to support the derivation of lower bounds on the number of operations required to solve various types of problems.