Sciweavers

298 search results - page 7 / 60
» Competitive Analysis of Flash-Memory Algorithms
Sort
View
JSSPP
2009
Springer
15 years 4 months ago
Competitive Two-Level Adaptive Scheduling Using Resource Augmentation
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we s...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
COCOON
2008
Springer
14 years 11 months ago
Average-Case Competitive Analyses for One-Way Trading
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi
79
Voted
ICDAR
2003
IEEE
15 years 3 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...
COCOON
2006
Springer
15 years 1 months 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...
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
14 years 11 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...