5473 search results - page 814 / 1095 » On the graph isomorphism problem |
200
Voted
AMAI
2004
Springer
16 years 15 hour 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...
203
click to vote
CSCLP
2004
Springer
16 years 9 hour 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...
181
click to vote
GECCO
2004
Springer
16 years 1 hour 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...
160
click to vote
SPAA
2003
ACM
15 years 12 months 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...
182
click to vote
COLT
2003
Springer
15 years 12 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...