46 search results - page 5 / 10 » Measures of Intrinsic Hardness for Constraint Satisfaction P... |
FOCI
2007
IEEE
15 years 4 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
AAAI
2008
14 years 12 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
110
Voted
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
CP
2008
Springer
14 years 11 months ago
2008
Springer
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
68
Voted
SSD
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we study the evaluation of continuous constraint queries (CCQs) for spatiotemporal streams. A CCQ triggers an alert whenever a configuration of constraints between s...