1389 search results - page 135 / 278 » Improved Approximation Algorithms for Label Cover Problems |
123
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
131
click to vote
EMO
2003
Springer
15 years 8 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
122
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
160
Voted
PODS
2012
ACM
13 years 5 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
125
click to vote
ICCAD
2008
IEEE
16 years 7 days ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...