766 search results - page 61 / 154 » Online Variance Minimization |
154
Voted
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
122
Voted
COCOON
2009
Springer
15 years 10 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...
134
Voted
ICALP
2004
Springer
15 years 9 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...
119
Voted
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
Novel online file sharing technologies have created new market dynamics and posed a great challenge to the music industry to try and retain customers. Consumers have created anony...
168
Voted
COMPGEOM
1992
ACM
15 years 7 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...