Sciweavers

4565 search results - page 725 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
68
Voted
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
15 years 6 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
110
Voted
ICNP
2005
IEEE
15 years 6 months ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood
85
Voted
IPPS
2005
IEEE
15 years 6 months ago
Desynchronized Pfair Scheduling on Multiprocessors
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...
UmaMaheswari C. Devi, James H. Anderson
104
Voted
ISQED
2005
IEEE
98views Hardware» more  ISQED 2005»
15 years 6 months ago
Wire Planning with Bounded Over-the-Block Wires
Hierarchical approach greatly facilitates large-scale chip design by hiding distracting details in low-level objects. However, the lowlevel designs have to have a global view of h...
Hua Xiang, I-Min Liu, Martin D. F. Wong
WECWIS
2005
IEEE
141views ECommerce» more  WECWIS 2005»
15 years 6 months ago
An Adaptive Bilateral Negotiation Model for E-Commerce Settings
This paper studies adaptive bilateral negotiation between software agents in e-commerce environments. Specifically, we assume that the agents are self-interested, the environment...
Vidya Narayanan, Nicholas R. Jennings