Sciweavers

980 search results - page 68 / 196
» Decentralized Constraint Satisfaction
Sort
View
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 9 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
13 years 8 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia
ICRA
2006
IEEE
106views Robotics» more  ICRA 2006»
14 years 3 months ago
Decentralized Optimization of Distributed Supply-chain
— In this paper, the problem of optimizing the performances of a distributed supply chain is faced by means of a decentralized architecture. In particular, a general scheme for a...
Marco Ghirardi, Giuseppe Menga, Nicola Sacco
ICTAI
2006
IEEE
14 years 3 months ago
Finding Crucial Subproblems to Focus Global Search
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
Susan L. Epstein, Richard J. Wallace
CP
2005
Springer
14 years 2 months ago
Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDona...