4843 search results - page 236 / 969 » The Shortcut Problem - Complexity and Approximation |
118
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
244
Voted
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
145
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
167
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
107
click to vote
DAC
2009
ACM
16 years 4 months ago
2009
ACM
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...