Sciweavers

858 search results - page 74 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
AAAI
2007
13 years 10 months ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
AGI
2008
13 years 9 months ago
Learning from Inconsistencies in an Integrated Cognitive Architecture
Whereas symbol
Kai-Uwe Kühnberger, Peter Geibel, Helmar Gust...
SIAMDM
2010
140views more  SIAMDM 2010»
13 years 6 months ago
Retractions to Pseudoforests
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 ...
Tomás Feder, Pavol Hell, Peter Jonsson, And...
CP
2007
Springer
14 years 2 months ago
Reformulating CSPs for Scalability with Application to Geospatial Reasoning
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
FLAIRS
2007
13 years 10 months ago
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search
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...
Pavel Surynek, Roman Barták