3049 search results - page 295 / 610 » On the Convergence of Bound Optimization Algorithms |
170
click to vote
CC
2004
Springer
16 years 1 days ago
2004
Springer
In theory, increasing alias analysis precision should improve compiler optimizations on C programs. This paper compares alias analysis algorithms on scalar optimizations, including...
199
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
148
click to vote
ICNP
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...
142
click to vote
WAOA
2004
Springer
15 years 12 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
149
click to vote
ESA
1999
Springer
15 years 11 months ago
1999
Springer
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...