417 search results - page 45 / 84 » In Search of the Best Constraint Satisfaction Search |
AAAI
1996
14 years 11 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
The primary business model behind Web search is based on textual advertising, where contextually relevant ads are displayed alongside search results. We address the problem of sel...
AI
2000
Springer
14 years 9 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
137
click to vote
MICCAI
2009
Springer
14 years 11 months ago
2009
Springer
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...