181 search results - page 27 / 37 » Practical Artificial Intelligence Programming With Java |
CP
2005
Springer
15 years 3 months 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...
CP
2005
Springer
15 years 3 months ago
2005
Springer
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
174
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
CP
2007
Springer
15 years 3 months ago
2007
Springer
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
CP
2007
Springer
15 years 3 months ago
2007
Springer
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...