1453 search results - page 121 / 291 » Partial Constraint Satisfaction |
153
click to vote
MATES
2009
Springer
15 years 10 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
141
click to vote
PODS
1990
ACM
15 years 8 months ago
1990
ACM
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...
120
click to vote
AIPS
2000
15 years 5 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
132
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
120
click to vote
SGAI
2007
Springer
15 years 10 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...