5889 search results - page 896 / 1178 » Graph Layout Problems |
207
click to vote
CSCLP
2004
Springer
16 years 2 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...
181
click to vote
GECCO
2004
Springer
16 years 2 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...
162
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...
184
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...
161
click to vote
DSN
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...