Sciweavers

2814 search results - page 11 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ALGORITHMICA
2005
92views more  ALGORITHMICA 2005»
13 years 8 months ago
Average-Case Competitive Analyses for Ski-Rental Problems
Let s be the ratio of the cost for purchasing skis over the cost for renting them. Then the famous result for the ski-rental problem shows that skiers should buy their skis after r...
Hiroshi Fujiwara, Kazuo Iwama
LATIN
2004
Springer
14 years 1 months ago
On the Competitiveness of AIMD-TCP within a General Network
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
Jeff Edmonds
ICDAR
2003
IEEE
14 years 1 months ago
ICDAR 2003 Robust Reading Competitions
This paper describes the robust reading competitions for ICDAR 2003. With the rapid growth in research over the last few years on recognizing text in natural scenes, there is an u...
Simon M. Lucas, Alex Panaretos, Luis Sosa, Anthony...
CORR
2008
Springer
211views Education» more  CORR 2008»
13 years 8 months ago
Competitive Design of Multiuser MIMO Systems based on Game Theory: A Unified View
Abstract--This paper considers the noncooperative maximization of mutual information in the Gaussian interference channel in a fully distributed fashion via game theory. This probl...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
COCOON
2006
Springer
14 years 9 days ago
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yu...