209 search results - page 14 / 42 » Speeding Up Constraint Propagation |
CP
2007
Springer
13 years 12 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
COR
2006
13 years 8 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
DEBU
1998
13 years 7 months ago
1998
Applications that rely on replicated data have different requirements for how their data is managed. For example, some applications may require that updates propagate amongst repl...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
WCE
2007
13 years 9 months ago
2007
—Applying nonequilibrium statistical mechanics we focus on nonequilibrium corrections Δs to entropy and energy of the fluid in terms of the nonequilibrium density distribution f...