Sciweavers

2566 search results - page 83 / 514
» The Online Median Problem
Sort
View
101
Voted
JOIN
2007
91views more  JOIN 2007»
15 years 18 days ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
15 years 2 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
97
Voted
JAIR
2008
130views more  JAIR 2008»
15 years 21 days ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
100
Voted
SODA
2010
ACM
371views Algorithms» more  SODA 2010»
15 years 10 months ago
Online Learning with Queries
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
Chao-Kai Chiang, Chi-Jen Lu
AIPS
2000
15 years 2 months ago
On-line Scheduling via Sampling
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong