1st International Workshop on Local Search Techniques in Constraint Satisfaction

Proceedings of LSCS'04, the 1st International Workshop on Local Search Techniques in Constraint Satisfaction

[1]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[2]  K. Hoffmann,et al.  Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies , 1992 .

[3]  Bart Selman,et al.  Problem Structure in the Presence of Perturbations , 1997, AAAI/IAAI.

[4]  Franco Zambonelli,et al.  Emergence of Macro Spatial Structures in Dissipative Cellular Automata , 2002, ACRI.

[5]  Christian Bessiere,et al.  Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.

[6]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[7]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[8]  Matthew W. Moskewicz,et al.  Cha : Engineering an e cient SAT solver , 2001, DAC 2001.

[9]  Steven David Prestwich,et al.  Coloration Neighbourhood Search With Forward Checking , 2002, Annals of Mathematics and Artificial Intelligence.

[10]  Hana Rudová,et al.  University Course Timetabling with Soft Constraints , 2002, PATAT.

[11]  Andrea Roli,et al.  Criticality and Parallelism in Structured SAT Instances , 2002, CP.

[12]  Marcel J. E. Golay,et al.  The merit factor of long low autocorrelation binary sequences , 1982, IEEE Trans. Inf. Theory.

[13]  D. Shmoys,et al.  Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem , 2002 .

[14]  Stephan Mertens,et al.  On the ground states of the Bernasconi model , 1997 .

[15]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[16]  Jin-Kao Hao,et al.  A General Approach for Constraint Solving by Local Search , 2004, J. Math. Model. Algorithms.

[17]  Bart Selman,et al.  Systematic Versus Stochastic Constraint Satisfaction , 1995, IJCAI.

[18]  Rolf Backofen,et al.  Excluding Symmetries in Constraint-Based Search , 1999, CP.

[19]  Pascal Van Hentenryck,et al.  A constraint-based architecture for local search , 2002, OOPSLA '02.

[20]  Edward A. Hirsch,et al.  Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination , 2001, CP.

[21]  Matthias F. Stallmann,et al.  Reliable Cost Predictions for Finding Optimal Solutions to LABS Problem: Evolutionary and Alternative Algorithms , 2003 .

[22]  Steven David Prestwich.  Negative Effects of Modeling Techniques on Search Performance , 2003, Ann. Oper. Res..

[23]  Cristopher Moore,et al.  The asymptotic order of the random k-SAT threshold , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[24]  Steven David Prestwich,et al.  Incomplete Dynamic Backtracking for Linear Pseudo-Boolean Problems , 2004, Ann. Oper. Res..

[25]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[26]  Stephen P. Boyd,et al.  Branch and Bound Methods , 1987 .

[27]  Stéphane Bressan,et al.  A SAT approach to query optimization in mediator systems , 2005, Annals of Mathematics and Artificial Intelligence.

[28]  Tad Hogg,et al.  Phase Transitions and the Search Problem , 1996, Artif. Intell..

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

[30]  Rina Dechter,et al.  Backjump-based backtracking for constraint satisfaction problems , 2002, Artif. Intell..

[31]  Narendra Jussien,et al.  The versatility of using explanations within constraint programming , 2003 .

[32]  Toby Walsh,et al.  Search in a Small World , 1999, IJCAI.

[33]  S. Mertens.  Exhaustive search for low-autocorrelation binary sequences , 1996 .

[34]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[35]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[36]  Anne Condon,et al.  Experiments with parallel graph coloring heuristics and applications of graph coloring , 1993, Cliques, Coloring, and Satisfiability.

[37]  Craig A. Morgenstern.  Distributed coloration neighborhood search , 1993, Cliques, Coloring, and Satisfiability.

[38]  Marcel J. E. Golay,et al.  A new search for skewsymmetric binary sequences with optimal merit factors , 1990, IEEE Trans. Inf. Theory.

[39]  Avi Ziv,et al.  Using a constraint satisfaction formulation and solution techniques for random test program generation , 2002, IBM Syst. J..

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

[41]  Jeremy Frank,et al.  When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..

[42]  Christian Blum,et al.  Critical Parallelization of Local Search for MAX-SAT , 2001, AI*IA.

[43]  N. Mott,et al.  Electronic Processes In Non-Crystalline Materials , 1940 .

[44]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[45]  H. Muhlenbein,et al.  Asynchronous parallel search by the parallel genetic algorithm , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[46]  J. Bernasconi.  Low autocorrelation binary sequences : statistical mechanics and configuration space analysis , 1987 .

[47]  Toby Walsh,et al.  Morphing: Combining Structure and Randomness , 1999, AAAI/IAAI.

[48]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002, Discret. Appl. Math..

[49]  Carla P. Gomes,et al.  Structure, Duality, and Randomization: Common Themes in AI and OR , 2000, AAAI/IAAI.

[50]  Christian Bessiere,et al.  Refining the Basic Constraint Propagation Algorithm , 2001, JFPLC.

[51]  Jin-Kao Hao,et al.  Tabu Search for Maximal Constraint Satisfaction Problems , 1997, CP.

[52]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[53]  Andrea Schaerf,et al.  Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems , 1997, IJCAI.

[54]  Andrea Roll.  Criticality and Parallelism in GSAT , 2001, Electron. Notes Discret. Math..

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

[56]  Bertrand Neveu,et al.  Maintaining arc consistency through constraint retraction , 1994, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94.

[57]  Steven David Prestwich,et al.  SAT problems with chains of dependent variables , 2003, Discret. Appl. Math..

[58]  Yoav Shoham,et al.  Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions , 2002, CP.

[59]  Patrice Boizumault,et al.  Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.

[60]  Philippe Codognet,et al.  Yet Another Local Search Method for Constraint Solving , 2001, SAGA.

[61]  Tad Hogg,et al.  Which Search Problems Are Random? , 1998, AAAI/IAAI.

[62]  Steven David Prestwich,et al.  Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search , 2002, Ann. Oper. Res..

[63]  Qizhong Wang.  Optimization by simulating molecular evolution , 1987, Biological Cybernetics.

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

[65]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[66]  Weixiong Zhang,et al.  Depth-First Branch-and-Bound versus Local Search: A Case Study , 2000, AAAI/IAAI.

[67]  Jeremy Frank.  Learning Short-Term Weights for GSAT , 1997, IJCAI.

[68]  Holger H. Hoos.  SAT-Encodings, Search Space Structure, and Local Search Performance , 1999, IJCAI.

[69]  Pascal Van Hentenryck,et al.  Control Abstractions for Local Search , 2003, Constraints.

[70]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[71]  J. Christopher Beck,et al.  Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics , 2000, Artif. Intell..

[72]  Toby Walsh,et al.  Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.

[73]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[74]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[75]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[76]  Sigal Asaf,et al.  FPgen - a test generation framework for datapath floating-point verification , 2003, Eighth IEEE International High-Level Design Validation and Test Workshop.

[77]  Henry Kautz,et al.  Noise Strategies for Local Search , 1994, AAAI 1994.

[78]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

[79]  Steven David Prestwich.  A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences , 2000, CP.

[80]  Ramón Béjar,et al.  Capturing Structure with Satisfiability , 2001, CP.

[81]  L. Darrell Whitley,et al.  Algorithm Performance and Problem Structure for Flow-shop Scheduling , 1999, AAAI/IAAI.

[82]  Toby Walsh,et al.  Search on High Degree Graphs , 2001, IJCAI.

[83]  Tad Hogg,et al.  Exploiting the Deep Structure of Constraint Problems , 1994, Artif. Intell..

[84]  Andrea Roli.  Design of a New Metaheuristic for MAXSAT Problems , 2002, CP.

[85]  Eleanore Hartson,et al.  Time Out , 1982 .

[86]  Michel Gendreau,et al.  A View of Local Search in Constraint Programming , 1996, CP.

[87]  Romuald Debruyne,et al.  Arc-consistency in dynamic CSPs is no more prohibitive , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

[88]  Thomas Stützle,et al.  Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT , 1999, Artif. Intell..

[89]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[90]  Dieter Beule,et al.  Evolutionary search for low autocorrelated binary sequences , 1998, IEEE Trans. Evol. Comput..

[91]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[92]  Alexander Nareyek.  Using global constraints for local search , 1998, Constraint Programming and Large Scale Discrete Optimization.

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