2861 search results - page 319 / 573 » Constraint Programming |
187
click to vote
AI
1999
Springer
15 years 6 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...
177
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
164
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
188
click to vote
MIDDLEWARE
2007
Springer
16 years 20 days ago
2007
Springer
This paper is about a novel rule-based approach for reasoning about qualitative spatiotemporal relations among technology-rich autonomous objects, to which we refer to as artifact...
153
click to vote
INFOCOM
2006
IEEE
16 years 17 days ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...