Relative support weight learning for constraint solving

AAAI Workshop - Technical Report

Volumn WS-06-11, Issue , 2006, Pages 115-122

  Petrovic, Smiljana ^a   Epstein, Susan ^a  

^a City College of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; PROBLEM SOLVING;

CONSTRAINT SATISFACTION PROBLEMS; HEURISTIC RECOMMENDATIONS; PRE-EXISTING ALGORITHMS;

CONSTRAINT THEORY;

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

References (16)

1. Bayardo, R. J. J. and R. Schrag (1996). Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances. Principles and Practice of Constraint Programming CP-1996, pp. 46-60.
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. and E. Freuder (2001). Collaborative Learning for Constraint Solving. Principles and Practice of Constraint Programming - CP2001 (T. Walsh, Ed.), pp. 46 - 60, Springer 2001, Paphos, Cyprus.
4. Epstein, S. L., E. C. Freuder and R. Wallace (2005). Learning to Support Constraint Programmers. Computational Intelligence 21(4): 337-371.
5. Frost, D. and R. Dechter (1995). Look-ahead Value Ordering for Constraint Satisfaction Problems. IJCAI-95, pp. 572-278.
6. Gent, I. P., P. Prosser and T. Walsh (1999). The Constrainedness of Search. AAAI/IAAI 1: 246-252.
7. Gomes, C., C. Fernandez, B. Selman and C. Bessiere (2004). Statistical Regimes Across Constraincdness Regions. 10th Conf. on Principles and Practice of Constraint Programming (CP-04) (M. Wallace, Ed.), pp. 32-46, Springer, Toronto, Canada.
8. Herbster, M. and M. Warmuth (1998). Tracking the Best Expert. Machine Learning 32: 151 - 178.
9. Hulubei, T. and B. O'Sullivan (2005). Search Heuristics and Heavy-Tailed Behavior. Principles and Practice of Constraint Programming - CP 2005 (P. V. Beek, Ed.), pp. 328-342, Berlin: Springer-Verlag.
10. Kivinen, J. and M. K. Warmuth (1999). Averaging expert predictions. Computational Learning Theory: 4th European Conference (EuroCOLT '99), pp. 153-167, Springer, Berlin.
11. Kiziltan, Z., P. Flener and B. Hnich (2001). Towards Inferring Labelling Heuristics for CSP Application Domains. KI'01, Springer-Verlag.
12. Petrovic, S. and S. L. Epstein (2006). Full Restart Speeds Learning. Proceedings of the 19th International FLAIRS Conference (FLAIRS-06), Melbourne Beach, Florida.
13. Ruan, Y., H. Kautz and E. Horvitz (2004). The backdoor key: A path to understanding problem hardness. Proceedings of the Nineteenth National Conference on Artificial Intelligence, pp. 124-130, San Jose, CA, USA.
14. Russell, S. and P. Norvig (2003). Artificial Intelligence A Modern Approach, Prentice Hall, Upper Saddle River, NJ.
15. Sabin, D. and E. C. Freudcr (1994). Contradicting Conventional Wisdom in Constraint Satisfaction. Eleventh European Conference on Artificial Intelligence, pp. 125-129, John Wiley & Sons, Amsterdam.
16. Valentini, G. and F. Masulli (2002). Ensembles of learning machines. Neural Nets WIRN Vietri-02 (M. M. a. R. Tagliaferri, Ed.), Springer-Verlag, Heidelberg, Italy.