An introduction to the theory of lists
Proceedings of the NATO Advanced Study Institute on Logic of programming and calculi of discrete design
An algebra for search problems and their solutions
Search in Artificial Intelligence
Predicate calculus and program semantics
Predicate calculus and program semantics
Programming: the derivation of algorithms
Programming: the derivation of algorithms
An intersection theorem for supermatroids
Journal of Combinatorial Theory Series B
Algorithms: design techniques and analysis
Algorithms: design techniques and analysis
The Science of Programming
Parallel Algorithm Derivation and Program Transformation
Parallel Algorithm Derivation and Program Transformation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Introduction to Algorithms
From Dynamic Programming to Greedy Algorithms
Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Algorithm synthesis through problem reformulation
Algorithm synthesis through problem reformulation
A knowledge-driven approach to web-based learning for formal algorithm development
ICWL'10 Proceedings of the 2010 international conference on New horizons in web-based learning
| Hi-index | 0.00 |
The greedy approach is widely used for combinatorial optimization problems, but its implementation varies from problem to problem. In this paper we propose a mechanical approach for implementing greedy algorithmic programs. Using PAR method, a problem can be continually partitioned into subproblems in smaller size based on the problem singleton and the maximum selector, and the greedy algorithm can be mechanically generated by combining the problem-solving sequences. Our structural model supports logical transformation from specifications to algorithmic programs by deductive inference, and thus significantly promotes the automation and reusability of algorithm design.