Sciweavers

4208 search results - page 478 / 842
» Better Selection of the Best
Sort
View
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
16 years 27 days ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
CGO
2006
IEEE
16 years 26 days ago
A Self-Repairing Prefetcher in an Event-Driven Dynamic Optimization Framework
Software prefetching has been demonstrated as a powerful technique to tolerate long load latencies. However, to be effective, prefetching must target the most critical (frequently...
Weifeng Zhang, Brad Calder, Dean M. Tullsen
FOCS
2006
IEEE
16 years 26 days ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans
GLOBECOM
2006
IEEE
16 years 26 days ago
Toposemantic Network Clustering
— We study the problem of building an optimal network-layer clustering hierarchy, where the optimality can be defined using three potentially conflicting metrics: state, delay ...
Leonid B. Poutievski, Kenneth L. Calvert, Jim Grif...
199
Voted
GLOBECOM
2006
IEEE
16 years 26 days ago
A Location-Based Vertical Handoff Decision Algorithm for Heterogeneous Mobile Networks
— Next-generation mobile communication systems will provide “always best connected” services to mobile users via cellular networks that provide wide area coverage for global ...
Jie Zhang, Henry C. B. Chan, Victor C. M. Leung