2566 search results - page 104 / 514 » The Online Median Problem |
99
Voted
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
110
Voted
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
105
click to vote
SODA
1997
ACM
15 years 2 months ago
1997
ACM
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
88
Voted
MFCS
2001
Springer
15 years 5 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
99
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
We design algorithms for two online variance minimization problems. Specifically, in every trial t our algorithms get a covariance matrix Ct and try to select a parameter vector wt...