407 search results - page 67 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We consider the novel problem of dynamically assigning application sessions of mobile users or user groups to service points. Such assignments must balance the tradeoff between...
81
Voted
IWQOS
2004
Springer
15 years 2 months ago
2004
Springer
This paper investigates the performance of a content distribution network designed to provide bounded content access latency. Content can be divided into multiple classes with dif...
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—In today’s Internet, online social networks (OSNs) play an important role in informing users about content. At the same time, mobile devices provide ubiquitous access to this ...
92
Voted
LCN
2006
IEEE
15 years 3 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
AAAI
2010
14 years 11 months ago
2010
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...