8540 search results - page 49 / 1708 » The Dynamic Servers Problem |
COREGRID
2007
Springer
14 years 4 months ago
2007
Springer
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
ESA
1995
Springer
14 years 1 months ago
1995
Springer
We present a poly-log-competitive deterministic online algorithm for the online transportation problem on hierarchically separated trees when the online algorithm has one extra se...
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
CEAS
2006
Springer
14 years 1 months ago
2006
Springer
Store-and-forward MTA relaying servers have frequently presented problems to various antispam techniques, such as IPbased reputation or email authentication. Algorithms that find ...
GLOBECOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...