1051 search results - page 107 / 211 » Foundations of Constraint Satisfaction |
CP
1998
Springer
14 years 2 months ago
1998
Springer
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
MATES
2009
Springer
14 years 4 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...
PODS
1990
ACM
14 years 2 months ago
1990
ACM
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...
AIPS
2000
13 years 11 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...
CVPR
2008
IEEE
15 years 2 days 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...