Full restart speeds learning

FLAIRS 2006 - Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference

Volumn 2006, Issue , 2006, Pages 104-109

  Petrovic, Smiljana ^a   Epstein, Susan ^a  

^a City College of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING; SOFTWARE ENGINEERING; STANDARDS;

CONSTRAINT SATISFACTION; PERFORMANCE STANDARDS; REAL-WORLD PROBLEMS; TRAINING PROBLEMS;

LEARNING SYSTEMS;

EID: 33746044201     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Beck, C., P. Prosser and R. J. Wallace (2003). Toward Understanding Variable Ordering Heuristics for Constraint Satisfaction Problems. Fourteenth Irish Artificial Intelligence and Cognitive Science Conference - AICS 2003, pp. 11-16.
2. Epstein, S. L. (1994). For the Right Reasons: The FORR Architecture for Learning in a Skill Domain. Cognitive Science 18: 479-511.
3. Epstein, S. L., E. C. Freuder and R. Wallace (2005). Learning to Support Constraint Programmers. Computational Intelligence 21(4):337-371.
4. Gomes, C., C. Fernandez., B. Selman and C. Bessiere (2004). Statistical Regimes Across Constrainedness Regions. Principles and Practice of Constraint Programming (CP-04), pp. 32-46, Springer, Toronto, Canada.
5. Gomes, C. P., B. Selman, N. Crato and H. Kautz (2000). Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. Journal of Automated Reasoning: 67-100.
6. Hulubei, T. and B. O'Sullivan (2005). Search Heuristics and Heavy-Tailed Behavior. Principles and Practice of Constraint Programming (CP-05), pp. 328-342, Berlin: Springer-Verlag.
7. Kautz, H., E. Horvitz, Y. Ruan, C. Gomes and B. Selman (2002). Dynamic restart policies. Eighteenth National Conference on Artificial Intelligence, pp. 674 - 681, AAAI Press, Edmonton, Alberta, Canada.
8. Luby, M., A. Sinclair and D. Zuckerman (1993). Optimal Speedup of Las Vegas Algorithms. Israel Symposium on Theoretical Aspects of Computer Science ISTCS, pp. 128-133.
9. Mackworth, A. K. (1977). Consistency in Networks of Relations. Artificial Intelligence 8: 99-118.
10. Ruan, Y., E. Horvitz and H. Kautz (2003). Hardness-Aware Restart Policies. IJCAI-03 Workshop on Stochastic Search Algorithms, Acapulco, Mexico.
11. Sadeh-Koniecpol, N., Y. Nakakuki and S. R. Thangiah (1997). Learning to Recognize (Un)Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing. Annals of Operations Research 75: 189-208.
12. Schapire, R. E. (1990). The strength of weak learnability. Machine Learning 5(2): 197-227.
13. Walsh, T. (1999). Search in a small world. IJCAI-W, pp. 1172-1177, Morgan Kaufmann Publishers, San Francisco, CA, Stockholm, Sweden.
14. Zhang, H. (2002). A random jump strategy for combinatorial search. Sixth International Symposium on Artificial Intelligence and Mathematics, pp. 9, Fort Lauderdale, FL.