Algorithm portfolios

Artificial Intelligence

Volumn 126, Issue 1-2, 2001, Pages 43-62

  Gomes, Carla P ^a   Selman, Bart ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING; RANDOM PROCESSES;

RANDOMIZED ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 0035250831     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00081-3     Document Type: Article

References (27)

1. Aldous D., Vazirani U. Go with the winners algorithms. Proc. 35th Symposium on the Found. of Comp. Sci. 1994;492-501 IEEE Press.
2. Alt H., Guibas L., Mehlhorn K., Karp R., Wigderson A. A method for obtaining randomized algorithms with small tail probabilities. Algorithmica. 16:(4-5):1996;543-547.
3. Anderson L. Completing partial latin squares. Mathematisk Fysiske Meddelelser. 41:1985;23-69.
4. Brelaz D. New methods to color the vertices of a graph. Comm. ACM. 22:(4):1979;251-256.
5. Colbourn C. Embedding partial Steiner triple systems is NP-complete. J. Combin. Theory A. 35:1983;100-105.
6. Dean T., Boddy M. An analysis of time-dependent planning. Proc. AAAI-88, St. Paul, MN. 1988;49-54.
7. Denes J., Keedwell A. Latin Squares and their Applications. 1974;Akademiai Kiado, Budapest/English Universities Press, London.
8. Ertel W., Luby M. Optimal parallelization of Las Vegas algorithms. Proc. Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. 775:1994;463-475 Springer, Berlin.
9. Fujita M., Slaney J., Bennett F. Automatic generation of some results in finite algebra. Proc. IJCAI-93, Chambéry, France. 1993;52-57 AAAI Press, Menlo Park, CA.
10. Gomes C.P., Selman B. Algorithm portfolio design: Theory vs. practice. Proc. 13th Conference on Uncertainty in Artificial Intelligence (UAI-97), Providence, RI. 1997;190-197 Morgan Kaufmann, San Mateo, CA.
11. Gomes C.P., Selman B. Problem structure in the presence of perturbations. Proc. AAAI-97, Providence, RI. 1997;221-227 AAAI Press, Menlo Park, CA.
12. Gomes C.P., Selman B., Crato N. Heavy-tailed distributions in combinatorial search. Smolka G. Principles and Practice of Constraint Programming (CP'97), Linz, Austria. Lecture Notes in Computer Science. 1997;121-135 Springer, Berlin.
13. Gomes C.P., Selman B., Kautz H. Boosting combinatorial search through randomization. Proc. AAAI-98, Providence, RI. 1998;431-438 AAAI Press, Menlo Park, CA.
14. Gomes C.P., Selman B., Crato N., Kautz H. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Automat. Reason. 24:(1-2):2000;67-100.
15. Horvitz E., S.Z. Proceedings of Flexible Computation, Technical Report, AAAI Fall Symposium. 1995.
16. Huberman B., Lukose R., Hogg T. An economics approach to hard computational problems. Science. 275:1997;51-54.
17. Kautz H., Selman B. Unifying SAT-based and graph-based planning. Dean T. Proc. IJCAI-99, Stockholm, Sweden. 1999;318-325 Morgan Kaufmann, San Mateo, CA.
18. Kautz H., Walser J. State-space planning by integer optimization. Proc. AAAI-99, Orlando, FL. 1999;526-533 AAAI Press, Menlo Park, CA.
19. Lam C., Thiel L., Swiercz S. The non-existence of finite projective planes of order 10. Can. J. Math. XLI:(6):1994;1117-1123.
20. Luby M., Sinclair A., Zuckerman D. Optimal speedup of Las Vegas algorithms. Inform. Process. Lett. 47:1993;173-180.
21. Motwani R., Raghavan P. Randomized Algorithms. 1995;Cambridge University Press, Cambridge, England.
22. Puget J.F., Leconte M. Beyond the black box: Constraints as objects. Proc. ILPS'95, Lisbon, Portugal. 1995;513-527 MIT Press, Cambridge, MA.
23. Russell S., Norvig P. Artificial Intelligence: A Modern Approach. 1995;Prentice Hall, Englewood Cliffs, NJ.
24. Salman F.S., Kalagnanam J.R., Davenport A. Cooperative strategies for solving the bicriteria sparse multiple knapsack problem. Proc. Congress on Evolutionary Computation. 1999;53-60.
25. Selman B., Kirkpatrick S. Finite-size scaling of the computational cost of systematic search. Artificial Intelligence. 81:(1-2):1996;273-295.
26. Trick M., D.J. Proc. DIMACS Challenge on Satisfiability Testing, Graph Coloring, and Cliques. DIMACS Series on Discr. Math. 1996;Am. Math. Soc. Providence, RI.
27. Vossen T., Ball M., Lotem A., Nau D. Integer programming models in AI planning, Technical Report, Workshop on Planning as Combinatorial Search (held in conjunction with AIPS-98), Pittsburgh, PA. 1999.