- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems.Steven Minton, Mark D. Johnston, Andrew B. Philips & Philip Laird - 1992 - Artificial Intelligence 58 (1-3):161-205.details
|
|
|
Iterative state-space reduction for flexible computation.Weixiong Zhang - 2001 - Artificial Intelligence 126 (1-2):109-138.details
|
|
|
Problem structure heuristics and scaling behavior for genetic algorithms.Scott H. Clearwater & Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):327-347.details
|
|
|
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability.Zhao Xing & Weixiong Zhang - 2005 - Artificial Intelligence 164 (1-2):47-80.details
|
|
|
Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.details
|
|
|
Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems.Joseph C. Pemberton & Weixiong Zhang - 1996 - Artificial Intelligence 81 (1-2):297-325.details
|
|
|
An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.details
|
|
|
Multi-agent oriented constraint satisfaction.Jiming Liu, Han Jing & Y. Y. Tang - 2002 - Artificial Intelligence 136 (1):101-144.details
|
|
|
Arc consistency for soft constraints.Martin Cooper & Thomas Schiex - 2004 - Artificial Intelligence 154 (1-2):199-227.details
|
|
|
Fuzzy rrDFCSP and planning.Ian Miguel & Qiang Shen - 2003 - Artificial Intelligence 148 (1-2):11-52.details
|
|
|
Qualitative choice logic.Gerhard Brewka, Salem Benferhat & Daniel Le Berre - 2004 - Artificial Intelligence 157 (1-2):203-237.details
|
|
|
Abstracting soft constraints: Framework, properties, examples.Stefano Bistarelli, Philippe Codognet & Francesca Rossi - 2002 - Artificial Intelligence 139 (2):175-211.details
|
|
|
Configuration landscape analysis and backbone guided local search.Weixiong Zhang - 2004 - Artificial Intelligence 158 (1):1-26.details
|
|
|
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1457-1491.details
|
|
|
Solving weighted CSP by maintaining arc consistency.Javier Larrosa & Thomas Schiex - 2004 - Artificial Intelligence 159 (1-2):1-26.details
|
|
|
Maintaining reversible DAC for Max-CSP.Javier Larrosa, Pedro Meseguer & Thomas Schiex - 1999 - Artificial Intelligence 107 (1):149-163.details
|
|
|
A general scheme for automatic generation of search heuristics from specification dependencies☆☆preliminary versions of this paper were presented in [15,16,18]. This work was supported in part by nsf grant iis-0086529 and by muri onr award n00014-00-1-0617. [REVIEW]Kalev Kask & Rina Dechter - 2001 - Artificial Intelligence 129 (1-2):91-131.details
|
|
|
Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.details
|
|
|
Open constraint programming.Boi Faltings & Santiago Macho-Gonzalez - 2005 - Artificial Intelligence 161 (1-2):181-208.details
|
|
|
Image interpretation with a conceptual graph: Labeling over-segmented images and detection of unexpected objects.Aline Deruyver, Yann Hodé & Luc Brun - 2009 - Artificial Intelligence 173 (14):1245-1265.details
|
|
|
Cyclic consistency: A local reduction operation for binary valued constraints.Martin C. Cooper - 2004 - Artificial Intelligence 155 (1-2):69-92.details
|
|
|
The complexity of soft constraint satisfaction.David A. Cohen, Martin C. Cooper, Peter G. Jeavons & Andrei A. Krokhin - 2006 - Artificial Intelligence 170 (11):983-1016.details
|
|
