Selecting the right heuristic algorithm: Runtime performance predictors

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

Volumn 1081, Issue , 1996, Pages 41-53

  Allen, John A ^a   Minton, Steven ^b  

^a NASA AMES RESEARCH CENTER   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957873202     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61291-2_40     Document Type: Conference Paper

References (18)

1. P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proceedings of the 12th IJCAI, pages 331-337, Sydney, Australia, 1991. Morgan Kaufmann.
2. F. Glover. Tabu search-part I. ORSA Journal on Computing, 1(3):190-206, 1989.
3. F. Glover. Tabu search-part II. ORSA Journal on Computing, 2:4-32, 1990.
4. M. Johnston and S. Minton. Analyzing a heuristic strategy for constraintsatisfaction and scheduling. In M. Zweben and M. Fox, editors, Intelligent Scheduling, pages 257-290. Morgan Kaufmann, 1994.
5. L. Kale. An almost perfect heuristic for the n nonattacking queens problem. Inf. Process. Lett., 34:173-178, 1990.
6. D. Knuth. Estimating the efficiency of backtrack programs. Mathematics of Computation, 29:121-136, 1975.
7. V. Kumar. Algorithms for constraint-satisfaction problems: a survey. AI Magazine, 13(1):32-44, 1992.
8. S. Minton. Integrating heuristics for constraint satisfaction problems: A case study. In Proceedings of the Eleventh National Conference on Artificial Intelligence, San Jose, CA, 1993. AAAI Press.
9. S. Minton, M. Johnston, A. Philips, and P. Laird. Minimizing conficts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161-205, 1992.
10. D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of SAT problems. In Proceedings of AAAI-92, pages 459-465, San Jose, CA, 1991. AAAI Press.
11. N. Muscettola. HSTS: Integrating planning and scheduling. In M. Zweben and M. Fox, editors, Intelligent Scheduling, pages 169-212. Morgan Kaufmann, 1994.
12. B. Nadel. Tree search and arc consistency in constraint satisfaction algorithms. In L. Kanal and V. Kumar, editors, Search in Artificial Intelligence, pages 287-342. Springer-Verlag, 1988.
13. V. Rao and V. Kumar. Superlinear speedup in state-space search. In Conference on foundations of softwar technology and theoretical computer science, 1988.
14. D. Sabin and E. Freuder. Constradicting conventional wisdom in constraint satisfaction. In A. Borning, editor, Proceedings of the 1995 Workshop on Principles and Practice of Constraint Programming, Orcas Island, Washington, 1994. Springer- Verlag.
15. N. Sadeh. Look-ahead techniques for micro-opportunist job shop scheduling. Technical Report CMU-CS-91-102, School of Computer Science, Carnegie Mellon, 1991.
16. N. Sadeh. Micro-opportunistic scheduling: the micro-boss factory scheduler. In M. Zweben and M. Fox, editors, Intelligent Scheduling, pages 99-135. Morgan Kaufmann, 1994.
17. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of AAA1-92, pages 440-446, San Jose, CA, 1992. AAAI Press.
18. D. Smith. Transformational approach to scheduling. Technical Report KES.U.92.2, Kestrel Institute, 1992.