Configurable solvers: Tailoring general methods to specific applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1330, Issue , 1997, Pages 372-374

  Minton, Steven ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY;

CONSTRAINT BASED PROBLEM SOLVING; CONSTRAINT-BASED; GENERAL METHOD; GENERIC ALGORITHM; NEW APPROACHES; STATE OF THE ART;

COMPUTER PROGRAMMING;

EID: 84948986426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017453     Document Type: Conference Paper

References (5)

1. J. Allen and S. Minton. Selecting the right heuristic algorithm: Runtime performance predictors. In Proceedings of the Canadian Al Conference, 1996.
2. D.J. Cook and R.Craig Varnell. Maximizing the benefits of parallel search using machine learning. In Proceedings AAAI-97, 1997.
3. S. Minton. An analytic learning system for specializing heuristics. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, 1993.
4. S. Minton. Automatically configuring constraint satisfaction programs: A case study (in press). Constraints, 1(1), 1996.
5. D.R. Smith. KIDS: A knowledge-based software development system. In M.R. Lowry and R.D. McCartney, editors, Automating Software Design. AAAI Press, 1991.