A general model and thresholds for random constraint satisfaction problems
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
On the phase transitions of random k-constraint satisfaction problems.Yun Fan &Jing Shen -2011 -Artificial Intelligence 175 (3-4):914-927.
Random constraint satisfaction: Easy generation of hard (satisfiable) instances.Ke Xu,Frédéric Boussemart,Fred Hemery &Christophe Lecoutre -2007 -Artificial Intelligence 171 (8-9):514-534.
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems.Martin C. Cooper,Aymeric Duchein,Achref El Mouelhi,Guillaume Escamocher,Cyril Terrioux &Bruno Zanuttini -2016 -Artificial Intelligence 234 (C):196-218.
Compiling constraint satisfaction problems.Rainer Weigel &Boi Faltings -1999 -Artificial Intelligence 115 (2):257-287.
Solving quantified constraint satisfaction problems.Ian P. Gent,Peter Nightingale,Andrew Rowley &Kostas Stergiou -2008 -Artificial Intelligence 172 (6-7):738-771.
Backjump-based backtracking for constraint satisfaction problems.Rina Dechter &Daniel Frost -2002 -Artificial Intelligence 136 (2):147-188.
Domain permutation reduction for constraint satisfaction problems.Martin J. Green &David A. Cohen -2008 -Artificial Intelligence 172 (8-9):1094-1118.
Automated streamliner portfolios for constraint satisfaction problems.Patrick Spracklen,Nguyen Dang,Özgür Akgün &Ian Miguel -2023 -Artificial Intelligence 319 (C):103915.
Network-based heuristics for constraint-satisfaction problems.Rina Dechter &Judea Pearl -1987 -Artificial Intelligence 34 (1):1-38.
Variable-Centered Consistency in Model RB.Liang Li,Tian Liu &Ke Xu -2013 -Minds and Machines 23 (1):95-103.
Analytics
Added to PP
2020-12-22
Downloads
29 (#860,455)
6 months
7 (#613,993)
2020-12-22
Downloads
29 (#860,455)
6 months
7 (#613,993)
Historical graph of downloads
How can I increase my downloads?References found in this work
An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser -1996 -Artificial Intelligence 81 (1-2):81-109.
Random constraint satisfaction: Easy generation of hard (satisfiable) instances.Ke Xu,Frédéric Boussemart,Fred Hemery &Christophe Lecoutre -2007 -Artificial Intelligence 171 (8-9):514-534.
Locating the phase transition in binary constraint satisfaction problems.Barbara M. Smith &Martin E. Dyer -1996 -Artificial Intelligence 81 (1-2):155-181.
On the phase transitions of random k-constraint satisfaction problems.Yun Fan &Jing Shen -2011 -Artificial Intelligence 175 (3-4):914-927.
Home |New books and articles |Bibliographies |Philosophy journals |About PhilPapers |API |Contact us |Code of conduct
PhilPapers logo byAndrea Andrews andMeghan Driscoll.
This site uses cookies and Google Analytics (see ourterms & conditions for details regarding the privacy implications).Use of this site is subject toterms & conditions.
All rights reserved byThe PhilPapers Foundation
Server: philpapers-web-54b44b69b7-vb4rf uwo