Sciweavers

1453 search results - page 20 / 291
» Partial Constraint Satisfaction
Sort
View
KBSE
1997
IEEE
15 years 1 months ago
Exploiting Domain-Specific Knowledge to Refine Simulation Specifications
This paper discusses our approach to the problem of refining high-level simulation specifications. Our domain is simulated combat training for tank platoon members. Our input is a...
David Pautler, Steven Woods, Alex Quilici
FOCS
2008
IEEE
14 years 10 months ago
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
Siu On Chan, Michael Molloy
JACM
2010
116views more  JACM 2010»
14 years 8 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
CP
2009
Springer
15 years 10 months ago
Failed Value Consistencies for Constraint Satisfaction
In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of inconsistent instantiations (als...
Christophe Lecoutre, Olivier Roussel
PPSN
1998
Springer
15 years 1 months ago
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
A. E. Eiben, Jano I. van Hemert, Elena Marchiori, ...