711 search results - page 52 / 143 » Amalgams of Constraint Satisfaction Problems |
143
click to vote
AIMSA
2008
Springer
15 years 6 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....
122
click to vote
CSCLP
2003
Springer
15 years 9 months ago
2003
Springer
Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather ...
131
click to vote
CSL
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
114
click to vote
AAAI
2006
15 years 5 months ago
2006
Symmetry in constraint satisfaction problems (CSPs) has been considered in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or as an o...
154
click to vote
TIME
2002
IEEE
15 years 9 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] ...