6740 search results - page 1028 / 1348 » An s -Hamiltonian Line Graph Problem |
174
click to vote
ICDT
2005
ACM
16 years 9 days ago
2005
ACM
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
204
click to vote
AMAI
2004
Springer
16 years 5 days ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
212
Voted
CSCLP
2004
Springer
16 years 5 days ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
186
click to vote
GECCO
2004
Springer
16 years 5 days ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
163
click to vote
SPAA
2003
ACM
16 years 23 hour ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...