1264 search results - page 26 / 253 » The framework approach for constraint satisfaction |
129
click to vote
TIME
2002
IEEE
15 years 6 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
137
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
112
Voted
CP
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
CP
2001
Springer
15 years 6 months ago
2001
Springer
Initial value problems for parametric ordinary differential equations (ODEs) arise in many areas of science and engineering. Since some of the data is uncertain, traditional numer...
124
click to vote
AIMSA
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....