Characterization of a new restart strategy for randomized backtrack search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3419 LNAI, Issue , 2005, Pages 56-70

  Guddeti, Venkata Praveen ^a   Choueiry, Berthe Y ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACK SEARCH;

CHARACTERIZATION; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HEURISTIC METHODS; PERFORMANCE; RESOURCE ALLOCATION;

PROBLEM SOLVING;

EID: 26844484662     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11402763_5     Document Type: Conference Paper

References (18)

1. Gomes, C.P., Selman, B., Kautz, H.: Boosting Combinatorial Search Through Randomization. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98). (1998) 431-437
2. th IJCAI. (1999) 1172-1177
3. Lim, R., Guddeti, V.P., Choueiry, B.Y.: An Interactive System for Hiring and Managing Graduate Teaching Assistants. In: Conference on Prestigious Applications of Intelligent Systems (ECAI04), Valencia, Spain (2004) 730-734
4. Glaubius, R.: A Constraint Processing Approach to Assigning Graduate Teaching Assistants to Courses. Undergraduate Honors Thesis. Department of Computer Science & Engineering, University of Nebraska-Lincoln (2001)
5. Glaubius, R., Choueiry, B.Y.: Constraint Constraint Modeling and Reformulation in the Context of Academic Task Assignment. In: Working Notes of the Workshop Modelling and Solving Problems with Constraints, ECAI 2002, Lyon, France (2002)
6. th International Conference on Principle and Practice of Constraint Programming (CP'02). Volume 2470 of LNCS., Springer (2002) 789
7. Freuder, E.C., Wallace, R.J.: Partial Constraint Satisfaction. Artificial Intelligence 58 (1992) 21-70
8. Prosser, P.: Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence 9 (3) (1993) 268-299
9. Guddeti, V.P.: Empirical Evaluation of Heuristic and Randomized Backtrack Search. Master's thesis, Computer Science & Engineering, University of Nebraska-Lincoln (2004)
10. Zou, H., Choueiry, B.Y.: Characterizing the Behavior of a Multi-Agent Search by Using it to Solve a Tight, Real-World Resource Allocation Problem. In: Workshop on Applications of Constraint Programming, Kinsale, County Cork, Ireland (2003) 81-101
11. Zou, H.: Iterative Improvement Techniques for Solving Tight Constraint Satisfaction Problems, Master's thesis, Computer Science & Engineering, University of Nebraska-Lincoln (2003)
12. Zou, H., Choueiry, B.Y.: Multi-agent Based Search versus Local Search and Backtrack Search for Solving Tight CSPs: A Practical Case Study. In: Working Notes of the Workshop on Stochastic Search Algorithms (IJCAI03), Acapulco, Mexico (2003) 17-24
13. Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. Artificial Intelligence 58 (1992) 161-205
14. Barták, R.: On-Line Guide to Constraint Programming. kti.ms.mff.cuni.cz/~bartak/constraints (1998)
15. Liu, J., Jing, H., Tang, Y.: Multi-Agent Oriented Constraint Satisfaction. Artificial Intelligence 136 (2002) 101-144
16. Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas Algorithms. In: Israel Symposium on Theory of Computing Systems. (1993) 128-133
17. Hoos, H., Stützte, T.: Stochastic Local Search Foundations and Applications. Morgan Kaufmann (2004)
18. van Hemert, J.I.: RandomCSP: generating constraint satisfaction problems randomly, homepages.cwi.nl/~jvhemert/randomcsp.html (2004)