Sciweavers

8540 search results - page 50 / 1708
» The Dynamic Servers Problem
Sort
View
DCC
2008
IEEE
14 years 9 months ago
Server Placement in Multiple-Description-Based Media Streaming
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 a me...
Satyajeet Ahuja, Marwan Krunz
EVOW
2004
Springer
14 years 3 months ago
Constructing Dynamic Optimization Test Problems Using the Multi-objective Optimization Concept
Abstract. Dynamic optimization using evolutionary algorithms is receiving increasing interests. However, typical test functions for comparing the performance of various dynamic opt...
Yaochu Jin, Bernhard Sendhoff
COR
2006
96views more  COR 2006»
13 years 10 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan
CN
2006
112views more  CN 2006»
13 years 10 months ago
Optimal server allocations for streaming multimedia applications on the Internet
In this paper, we address the server selection problem for streaming applications on the Internet. The architecture we consider is similar to the content distribution networks con...
Padmavathi Mundur, Poorva Arankalle
ICCS
2005
Springer
14 years 3 months ago
Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks
Abstract. Replication of content on geographically distributed servers can improve both performance and reliability of the Web service. Anycast is a one-toone-of-many delivery tech...
Krzysztof Walkowiak