Sciweavers

1403 search results - page 34 / 281
» On Communication in Solving Distributed Constraint Satisfact...
Sort
View
AAAI
1996
14 years 11 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
EVOW
2006
Springer
15 years 1 months ago
A Memetic Algorithm with Bucket Elimination for the Still Life Problem
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
75
Voted
CP
2001
Springer
15 years 2 months ago
New Lower Bounds of Constraint Violations for Over-Constrained Problems
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Jean-Charles Régin, Thierry Petit, Christia...
CCR
2004
90views more  CCR 2004»
14 years 9 months ago
A constraint satisfaction approach to testbed embedding services
Today's networking community is becoming increasingly skeptical of the significance of research results founded wholly upon experimental results conducted in simulation. Now, ...
Jeffrey Considine, John W. Byers, Ketan Meyer-Pate...
QSIC
2005
IEEE
15 years 3 months ago
Test Case Generation by OCL Mutation and Constraint Solving
Fault-based testing is a technique where testers anticipate errors in a system under test in order to assess or generate test cases. The idea is to have enough test cases capable ...
Bernhard K. Aichernig, Percy Antonio Pari Salas