7930 search results - page 58 / 1586 » Greedy in Approximation Algorithms |
131
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
115
Voted
ICS
2000
Tsinghua U.
15 years 6 months ago
2000
Tsinghua U.
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
108
Voted
GD
2008
Springer
15 years 3 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
103
click to vote
ICNP
2007
IEEE
15 years 9 months ago
2007
IEEE
— We present a new approach for generating virtual coordinates that produces usable coordinates quickly and improves the routing performance of existing geographic routing algori...
130
Voted
ESOA
2006
15 years 6 months ago
2006
Evolutionary algorithms based on "tags" can be adapted to induce cooperation in selfish environments such as peer-to-peer systems. In this approach, nodes periodically co...