Systematic Versus Stochastic Constraint Satisfaction

This panel explores issues of systematic and stochastic control in the context of constraint satisfaction.

[1]  Matthew L. Ginsberg,et al.  GSAT and dynamic backtracking , 1994, KR 1994.

[2]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[3]  Thomas Schiex,et al.  Solution Reuse in Dynamic Constraint Satisfaction Problems , 1994, AAAI.

[4]  James M. Crawford,et al.  Experimental Results on the Crossover Point inSatis ability , 1993 .

[5]  Andrew J. Davenport,et al.  GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement , 1994, AAAI.

[6]  Tad Hogg,et al.  Expected Gains from Parallelizing Constraint Solving for Hard Problems , 1994, AAAI.

[7]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[8]  Eugene C. Freuder,et al.  Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems , 1994 .

[9]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[10]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[11]  Eugene C. Freuder.  Exploiting Structure in Constraint Satisfaction Problems , 1993, NATO ASI CP.

[12]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[13]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[14]  Douglas R. Smith,et al.  Transformational approach to transportation scheduling , 1993, Proceedings of 8th Knowledge-Based Software Engineering Conference.

[15]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[16]  Rina Dechter,et al.  GSAT and Local Consistency , 1995, IJCAI.

[17]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[18]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[19]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[20]  P. Langley.  Systematic and nonsystematic search strategies , 1992 .

[21]  Makoto Yokoo,et al.  Weak-Commitment Search for Solving Constraint Satisfaction Problems , 1994, AAAI.

[22]  Khaled Ghedira.  Dynamic partial constraint satisfaction by multi-agent and simulated annealing , 1994 .

[23]  Heinz Mühlenbein,et al.  The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..

[24]  Rina Dechter,et al.  In Search of the Best Constraint Satisfaction Search , 1994, AAAI.

[25]  Gadi Pinkas,et al.  Improving Connectionist Energy Minimization , 1995, J. Artif. Intell. Res..

[26]  Stephen F. Smith,et al.  Slack-Based Heuristics for Constraint Satisfaction Scheduling , 1993, AAAI.

[27]  Christophe Lecoutre.  Constraint Networks , 1992 .

[28]  Eugene C. Freuder,et al.  Constraint-based reasoning , 1994 .

[29]  Kurt Konolige,et al.  Easy to be Hard: Difficult Problems for Greedy Algorithms , 1994, KR.

[30]  Edward P. K. Tsang,et al.  Using a genetic algorithm to tackle the processors configuration problem , 1994, SAC '94.