206 search results - page 14 / 42 » Random backtracking in backtrack search algorithms for satis... |
117
click to vote
APN
2003
Springer
15 years 10 months ago
2003
Springer
One of the key issues of object-oriented modeling is inheritance. It allows for the definition of a subclass that inherits features from some superclass. When considering the dynam...
155
click to vote
TIME
2002
IEEE
15 years 10 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] ...
140
click to vote
AAMAS
2000
Springer
15 years 4 months ago
2000
Springer
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
132
click to vote
IEAAIE
2001
Springer
15 years 9 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
159
click to vote
SAT
2009
Springer
15 years 11 months ago
2009
Springer
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...