On portfolios for backtracking search in the presence of deadlines

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 1, Issue , 2007, Pages 231-238

  Wu, Huayue ^a   Van Beek, Peter ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; CONSTRAINT THEORY; CYBERNETICS; SCHEDULING ALGORITHMS;

BACKTRACKING ALGORITHMS; BACKTRACKING SEARCH; COMPUTATIONAL RESOURCES; CONSTRAINT SATISFACTION; EMPIRICAL EVALUATIONS; INSTRUCTION SCHEDULING; INTERNATIONAL CONFERENCES; PROBLEM INSTANCES; PROPOSITIONAL SATISFIABILITY PROBLEMS; REAL-WORLD; SMALL SAMPLES; TEST BEDS;

LEARNING ALGORITHMS;

EID: 48649092353     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2007.38     Document Type: Conference Paper

References (26)

1. C. Bessiere. Constraint propagation. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, chapter 3. Elsevier, 2006.
2. T. Carchrae and J. C. Beck. Applying machine learning to low-knowledge control of optimization algorithms. Computational Intelligence, 21:372-387, 2005.
3. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. ACM, 5:394-397, 1962.
4. L. Finkelstein, S. Markovitch, and E. Rivlin. Optimal schedules for parallelizing anytime algorithms: The case of shared resources. J. of AI Research, 19:73-138, 2003.
5. M. Gagliolo and J. Schmidhuber. Learning dynamic algorithm portfolios. Annals of Math. and AI, 47:295-328, 2006.
6. M. Gagliolo and J. Schmidhuber. Learning restarts strategies. In Proc. of the 20th Int'l Joint Conf. on AI, pages 792-797, Hyderabad, India, 2007.
7. S. Golomb and L. Baumert. Backtrack programming. J. ACM, 12:516-524, 1965.
8. C. Gomes and B. Selman. Algorithm portfolio design: Theory vs. practice. In Proc. of the 13th Annual Conf. on Uncertainty in AI (UAI-97), pages 190-197, Providence, RI, 1997.
9. C. Gomes and B. Selman. Algorithm portfolios. Artif. Intell., 126:43-62, 2001.
10. C. Gomes, B. Selman, and N. Crato. Heavy-tailed distributions in combinatorial search. In Proc. of the Third Int'l Conf. on Principles and Practice of Constraint Programming, pages 121-135, Linz, Austria, 1997.
11. C. Gomes, B. Selman, N. Crato, and H. Kautz. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. of Automated Reasoning, 24:67-100, 2000.
12. C. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In Proc. of the Fifteenth National Conf. on AI, pages 431-437, Madison, Wisconsin, 1998.
13. A. Guerri and M. Milano. Learning techniques for automatic algorithm portfolio selection. In Proc. of the 16th European Conf. on AI, pages 475-479, Valencia, Spain, 2004.
14. W. D. Harvey. Nonsystematic backtracking search. PhD thesis, Stanford University, 1995.
15. T. Hogg and C. P. Williams. Expected gains from parallelizing constraint solving for hard problems. In Proc. of the Twelfth National Conf. on AI, pages 331-336, Seattle, 1994.
16. E. Horvitz, Y. Ruan, C. Gomes, H. Kautz, B. Selman, and M. Chickering. A Bayesian approach to tackling hard computational problems. In UAI-2001, pages 235-244, 2001.
17. B. A. Huberman, R. M. Lukose, and T. Hogg. An economics approach to hard computational problems. Science, 275:51-54, 1997.
18. H. Kautz, E. Horvitz, Y. Ruan, C. Gomes, and B. Selman. Dynamic restart policies. In Proc. of the Eighteenth National Conf. on AI, pages 674-681, Edmonton, 2002.
19. M. G. Lagoudakis and M. L. Littman. Learning to select branching rules in the DPLL procedure for satisfiability, 2001.
20. K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, and Y. Shoham. Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In Proc. of the Eighth Int'l Conf. on Principles and Practice of Constraint Programming, pages 556-572, Ithaca, New York, 2002.
21. K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, and Y. Shoham. Boosting as a metaphor for algorithm design. In Proc. of the Ninth Int'l Conf. on Principles and Practice of Constraint Programming, pages 899-903, Kinsale, Ireland, 2003.
22. L. Lobjois and M. Lemaitre. Branch and bound algorithm selection by performance prediction. In Proc. of the Fifteenth National Conf. on AI, pages 353-358, Madison, Wisconsin, 1998.
23. M. Luby, A. Sinclair, and D. Zuckerman. Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47:173-180, 1993.
24. A. M. Malik, J. McInnes, and P. van Beek. Optimal basic block instruction scheduling for multiple-issue processors using constraint programming. In Proc. of the 18th IEEE Int'l Conf. on Tools with AI, pages 279-287, Washington, DC, 2006.
25. Y. Ruan, E. Horvitz, and H. Kautz. Restart policies with dependence among runs: A dynamic programming approach. In Proc. of the Eighth Int'l Conf. on Principles and Practice of Constraint Programming, pages 573-586, Ithaca, New York, 2002.
26. P. van Beek. Backtracking search algorithms. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, chapter 4. Elsevier, 2006.