230 search results - page 3 / 46 » Constraint Satisfaction with Delayed Evaluation |
134
click to vote
UM
2009
Springer
16 years 4 days ago
2009
Springer
Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms prese...
159
Voted
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
156
Voted
SARA
2007
Springer
15 years 11 months ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
176
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
140
Voted
IJCAI
2001
15 years 7 months ago
2001
Parametric ordinary differential equations arise in many areas of science and engineering. Since some of the data is uncertain and given by intervals, traditional numerical method...