417 search results - page 38 / 84 » In Search of the Best Constraint Satisfaction Search |
CONSTRAINTS
2007
14 years 9 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
CP
2011
Springer
13 years 9 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
177
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
PRICAI
2004
Springer
15 years 3 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...