Sciweavers

287 search results - page 55 / 58
» An Algebraic Approach to Constraint Satisfaction Problems
Sort
View
CP
1995
Springer
13 years 11 months ago
On the Forward Checking Algorithm
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...
Fahiem Bacchus, Adam J. Grove
IJCAI
2003
13 years 9 months ago
On a generalization of triangulated graphs for domains decomposition of CSPs
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
Assef Chmeiss, Philippe Jégou, Lamia Keddar
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 7 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
AAAI
2000
13 years 9 months ago
RealPlan: Decoupling Causal and Resource Reasoning in Planning
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
Biplav Srivastava
INFOCOM
2006
IEEE
14 years 1 months ago
Capacity-Constrained Design of Resilient Multi-Tier Wireless Mesh Networks
nts etc.), an abstract graph of the deployment area and QoS constraints to generate appropriate logical topologies. WIND starts with the set of network elements to be deployed (Nod...
R. Raghuraman, Sridhar Iyer