Sciweavers

1453 search results - page 72 / 291
» Partial Constraint Satisfaction
Sort
View
CP
2008
Springer
14 years 11 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
14 years 9 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
74
Voted
ICTAI
2006
IEEE
15 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
BDA
2007
14 years 11 months ago
A Satisfaction Balanced Query Allocation Process for Distributed Information Systems
We consider a distributed information system that allows autonomous consumers to query autonomous providers. We focus on the problem of query allocation from a new point of view, ...
Jorge-Arnulfo Quiané-Ruiz, Philippe Lamarre...
AI
2005
Springer
14 years 9 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo