Limited assignments: A new cutoff strategy for incomplete depth-first search

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2005, Pages 388-392

  Barták, Roman ^a   Rudová, Hana ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Constraint satisfaction; Search

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INFORMATION RETRIEVAL; PROBLEM SOLVING;

CONSTRAINT SATISFACTION; CUTOFF STRATEGY; LIMITED ASSIGNMENT NUMBER (LAN); SEARCHES;

ITERATIVE METHODS;

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

References (11)

1. Dimitris Achlioptas, Carla Gomes, Henry Kautz, and Bart Selman. Generating Satisfiable Problem Instances. In Proceedings of National Conference on Artificial Intelligence (AAAI-2000). AAAI Press, 2000, 256-261.
2. Roman Barták, Tomáš Müller, Hana Rudová. A New Approach to Modelling and Solving Minimal Perturbation Problems. In Recent Advances in Constraints, 2003. Springer-Verlag LNAI3010, 2004, 223-249.
3. N. Beldiceanu, E. Bourreau, P. Chan, D. Rivreau, Partial Search Strategy in CHIP. In 2nd International Conference on Metaheuristics (MIC 97), 1997.
4. M. Carlsson, G. Ottosson, and B. Carlson. An open-ended finite domain constraint solver. In Programming Languages: Implementations, Logics, and Programming. Springer-Verlag LNCS 1292, 1997.
5. R. Dechter. Constraint Processing. Morgan Kaufmann Publishers, 2003.
6. Matthew L. Ginsberg and William D. Harvey. Iterative Broadening. In Proceedings of National Conference on Artificial Intelligence. AAAI Press, 1990, 216-220.
7. William D. Harvey. Nonsystematic backtracking search. PhD thesis, Stanford University, 1995.
8. William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search. In Proceedings of the International Joint Conference on Artificial Intelligence, 1995, 607-615.
9. Ewan MacIntyre, Patrick Prosser, Barbara Smith, and Toby Walsh. Random Constraint Satisfaction: theory meets practice. In Michael Maher and Jean-Francois Puget (eds.): Principles and Practice of Constraint Programming - CP98. Springer-Verlag LNCS 1520, 1998, 325-339.
10. Hana Rudová. Random Placement Problem. http://www.fi.muni.cz/ ~hanka/rpp/, 2002.
11. Hana Rudová and Keith Murray. University Course Timetabling with Soft Constraints. In Edmund Burke and Patrick De Causmaecker (eds.): Practice And Theory of Automated Timetabling IV. Springer-Verlag LNCS 2740, 2003, 310-328.