Sciweavers

103 search results - page 3 / 21
» On the Competitive Ratio of the Work Function Algorithm for ...
Sort
View
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 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...
JCO
2007
100views more  JCO 2007»
13 years 6 months ago
Semi-online scheduling with "end of sequence" information
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
Leah Epstein, Deshi Ye
ACIIDS
2012
IEEE
307views Database» more  ACIIDS 2012»
12 years 2 months ago
A Hybrid Evolutionary Imperialist Competitive Algorithm (HEICA)
This paper proposes a new approach by combining the Evolutionary Algorithm and Imperialist Competitive Algorithm. This approach tries to capture several people involved in communit...
Fatemeh Ramezani, Shahriar Lotfi, M. A. Soltani-Sa...
CIC
2006
102views Communications» more  CIC 2006»
13 years 7 months ago
On-line Algorithm for Server Selection of Video Streaming over P2P Networks
We consider a video streaming application over P2P networks and introduce the P2P on-line server selection problem. This task is related to the classic K-server problem, known fro...
Hao Wang, Andras Farago
JCO
2008
66views more  JCO 2008»
13 years 6 months ago
The hierarchical model for load balancing on two machines
Following previous work, we consider the hierarchical load balancing model on two machines of possibly different speeds. We first focus on maximizing the minimum machine load and ...
Orion Chassid, Leah Epstein