2976 search results - page 438 / 596 » On the bounded integer programming |
165
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
135
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we w...
160
click to vote
LICS
2000
IEEE
15 years 10 months ago
2000
IEEE
While Game Semantics has been remarkably successful at g, often in a fully abstract manner, a wide range of features of programming languages, there has to date been no attempt at...
141
click to vote
UAI
1996
15 years 7 months ago
1996
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
164
click to vote
APAL
2006
15 years 6 months ago
2006
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to t...