Phase Transitions and Search Problems, Artificial Intelligence, vol.81, issue.1-2, pp.1-15, 1996. ,
Easy Problems are Sometimes Hard, Artificial Intelligence, vol.70, pp.335-345, 1994. ,
The Hardest Constraint Problems: a Double Phase Transition, Artificial Intelligence, vol.69, pp.359-377, 1994. ,
Sparse Constraint Graphs and Exceptionally Hard Problems, Proceedings IJCAI'95, pp.646-651, 1995. ,
Finite-Size Scaling of the Computational Cost of Systematic Search, Artificial Intelligence, vol.81, pp.273-295, 1996. ,
Modelling Exceptionally Hard Constraint Satisfaction Problems, Proceedings CP'97, pp.182-195, 1997. ,
, Summarizing CSP Hardness with Continuous Probability Distributions. In: AAAI-97, pp.327-333, 1997.
Heavy-tailed Distributions in Combinatorial Search, Proceedings CP'97, pp.121-135, 1997. ,
, , 1998.
, Constraint Processing, 2003.
Formal Models of Heavy-tailed Behavior in Combinatorial Search, Proceedings CP'01, pp.408-421, 2001. ,
Backdoors to Typical Case Complexity, 2003. ,
, Proceedings CP'00, pp.441-456, 2000.
Random Constraint Satisfaction: a More Accurate Picture, Proceedings CP'97, pp.107-120, 1997. ,
Exact Phase Transition in Random Constraint Satisfaction Problems, JAIR, vol.12, pp.93-103, 2000. ,
Measuring Search Trees, Proceedings ECAI'04 Workshop on Modelling and Solving Problems with Constraints, 2004. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00108865
Ambulagan: Heuristics Based on Unit Propagation for Satisfiability Problems, Proceedings IJCAI'97, pp.366-371, 1997. ,