Sciweavers

4565 search results - page 199 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
NPC
2005
Springer
15 years 8 months ago
A Greedy Algorithm for Capacity-Constrained Surrogate Placement in CDNs
One major factor that heavily affects the performance of a content distribution network (CDN) is placement of the surrogates. Previous works take a network-centric approach and con...
Yifeng Chen, Yanxiang He, Jiannong Cao, Jie Wu
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
15 years 6 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan
IEEECIT
2010
IEEE
15 years 27 days ago
Non-recursive Algorithm of Tower of Hanoi Problem
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Fuwan Ren, Qifan Yang, Jiexin Zheng, Hui Yan
135
Voted
ICIP
2000
IEEE
16 years 4 months ago
Approximately Optimal Assignment for Unequal Loss Protection
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...
Alexander E. Mohr, Richard E. Ladner, Eve A. Riski...
EVOW
2007
Springer
15 years 8 months ago
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
Sandro Pirkwieser, Günther R. Raidl, Jakob Pu...