143 search results - page 11 / 29 » Timed CSP: A Retrospective |
137
click to vote
TALG
2010
15 years 4 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
162
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
187
click to vote
WLP
2004
Springer
15 years 12 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
185
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
160
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— We consider decision-making problems in Markov decision processes where both the rewards and the transition probabilities vary in an arbitrary (e.g., nonstationary) fashion. We...