Sciweavers

5329 search results - page 157 / 1066
» The Weighted Majority Algorithm
Sort
View
155
Voted
PODC
2009
ACM
16 years 3 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
FOCS
2009
IEEE
15 years 9 months ago
Two-Message Quantum Interactive Proofs Are in PSPACE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
Rahul Jain, Sarvagya Upadhyay, John Watrous
97
Voted
AAECC
2001
Springer
104views Algorithms» more  AAECC 2001»
15 years 7 months ago
On Senary Simplex Codes
This paper studies senary simplex codes of type α and two punctured versions of these codes (type β and γ). Self-orthogonality, torsion codes, weight distribution and weight hie...
Manish K. Gupta, David G. Glynn, T. Aaron Gulliver
145
Voted
SWAT
2000
Springer
114views Algorithms» more  SWAT 2000»
15 years 6 months ago
Maintaining Center and Median in Dynamic Trees
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...
Stephen Alstrup, Jacob Holm, Mikkel Thorup
WAOA
2010
Springer
237views Algorithms» more  WAOA 2010»
15 years 11 days ago
Lower Bounds for Smith's Rule in Stochastic Machine Scheduling
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz