1142 search results - page 103 / 229 » Approximability of Clausal Constraints |
184
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
201
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
167
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
194
click to vote
ESA
1995
Springer
15 years 10 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
179
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- In robot deployment problems, the fundamental issue is to optimize a steady state performance measure that depends on the spatial configuration of a group of robots. For...