7006 search results - page 501 / 1402 » Approximation Algorithms |
172
Voted
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
162
click to vote
TMC
2011
15 years 1 months ago
2011
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
168
Voted
STOC
2006
ACM
16 years 10 days ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
176
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
130
Voted
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...