Sciweavers

347 search results - page 15 / 70
» The Berlekamp-Massey Algorithm revisited
Sort
View
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
15 years 7 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
ESA
2007
Springer
121views Algorithms» more  ESA 2007»
16 years 4 days ago
Equitable Revisited
Wolfgang W. Bein, Lawrence L. Larmore, John Noga
WAOA
2005
Springer
77views Algorithms» more  WAOA 2005»
15 years 11 months ago
Deterministic Online Optical Call Admission Revisited
Elisabeth Gassner, Sven Oliver Krumke
LATIN
2000
Springer
15 years 9 months ago
The LCA Problem Revisited
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable...
Michael A. Bender, Martin Farach-Colton
FLAIRS
2000
15 years 7 months ago
Partitioning Sets with Genetic Algorithms
We first revisit a problem in the literature of genetic algorithms: arranging numbers into groups whose summed weights are as nearly equal as possible. We provide a new genetic al...
William A. Greene