Sciweavers

206 search results - page 14 / 42
» Random backtracking in backtrack search algorithms for satis...
Sort
View
APN
2003
Springer
14 years 1 months ago
Deciding Life-Cycle Inheritance on Petri Nets
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...
H. M. W. (Eric) Verbeek, Twan Basten
TIME
2002
IEEE
14 years 1 months ago
Applying Local Search to Temporal Reasoning
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] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
AAMAS
2000
Springer
13 years 8 months ago
Algorithms for Distributed Constraint Satisfaction: A Review
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...
Makoto Yokoo, Katsutoshi Hirayama
IEAAIE
2001
Springer
14 years 27 days ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
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...
María Isabel Alfonso Galipienso, Federico B...
SAT
2009
Springer
91views Hardware» more  SAT 2009»
14 years 3 months ago
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
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...
Eric I. Hsu, Sheila A. McIlraith