711 search results - page 105 / 143 » Amalgams of Constraint Satisfaction Problems |
169
click to vote
EMSOFT
2010
Springer
15 years 2 months ago
2010
Springer
Correct and efficient implementation of general real-time applications remains by far an open problem. A key issue is meeting timing constraints whose satisfaction depends on feat...
130
click to vote
AAAI
1996
15 years 5 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...
122
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
153
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
146
click to vote
AI
1999
Springer
15 years 4 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...