1051 search results - page 75 / 211 » Foundations of Constraint Satisfaction |
AAAI
2007
14 years 15 days ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
AGI
2008
13 years 11 months ago
2008
Whereas symbol
SIAMDM
2010
13 years 8 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
CP
2007
Springer
14 years 4 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
FLAIRS
2007
14 years 15 days ago
2007
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...