Sciweavers

5214 search results - page 206 / 1043
» The Online Specialization Problem
Sort
View
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
15 years 5 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
15 years 5 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
SP
2002
IEEE
114views Security Privacy» more  SP 2002»
15 years 4 months ago
Efficiently building on-line tools for distributed heterogeneous environments
Software development is getting more and more complex, especially within distributed middleware-based environments. A major drawback during the overall software development proces...
Günther Rackl, Thomas Ludwig 0002, Markus Lin...
EUROPAR
2009
Springer
15 years 11 months ago
POGGI: Puzzle-Based Online Games on Grid Infrastructures
Massively Multiplayer Online Games (MMOGs) currently entertain millions of players daily. To keep these players online and generate revenue, MMOGs are currently relying on manually...
Alexandru Iosup
ATAL
2005
Springer
15 years 10 months ago
An online POMDP algorithm for complex multiagent environments
In this paper, we present an online method for POMDPs, called RTBSS (Real-Time Belief Space Search), which is based on a look-ahead search to find the best action to execute at e...
Sébastien Paquet, Ludovic Tobin, Brahim Cha...