1144 search results - page 85 / 229 » Logic programming for combinatorial problems |
131
Voted
AI
1999
Springer
15 years 2 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...
116
click to vote
CP
2004
Springer
15 years 7 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
129
click to vote
CSL
2006
Springer
15 years 2 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
115
click to vote
SAGT
2010
Springer
15 years 26 days ago
2010
Springer
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...
122
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...