Computational geometry: an introduction
Computational geometry: an introduction
Top-down synthesis of divide-and-conquer algorithms
Artificial Intelligence
Understanding and Automating Algorithm Design
IEEE Transactions on Software Engineering - Special issue on artificial intelligence and software engineering
Artificial Intelligence
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The power of geometric duality
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
A knowledge-based approach to using efficiency estimation in program synthesis
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
This paper describes MEDUSA, an experimental algorithm synthesizer. MEDUSA is characterized by its top-down approach, its use of cost-constraints, and its restricted number of synthesis methods. Given this model, we discuss heuristics used to keep this process from being unbounded search through the solution space. The results indicate that the performance criteria can be used effectively to help avoid combinatorial explosion. The system has synthesized a number of algorithms in its test domain (geometric intersection problems) without operator intervention.