Sciweavers

1940 search results - page 192 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
IRI
2006
IEEE
16 years 17 days ago
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
Éric Grégoire, Bertrand Mazure, C&ea...
AAAI
2007
15 years 9 months ago
Computing Optimal Subsets
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...
AAAI
1996
15 years 7 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
AI
2010
Springer
15 years 6 months ago
AllDifferent-based filtering for subgraph isomorphism
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
Christine Solnon
AIPS
1994
15 years 7 months ago
Control Knowledge to Improve Plan Quality
Generating production-quality plans is an essential element in transforming planners from research tools into real-world applications. However most of the work to date on learning...
M. Alicia Pérez, Jaime G. Carbonell