Sciweavers

766 search results - page 61 / 154
» Online Variance Minimization
Sort
View
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
15 years 5 months ago
The Online Target Date Assignment Problem
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...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
COCOON
2009
Springer
15 years 6 months ago
Online Tree Node Assignment with Resource Augmentation
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...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung...
ICALP
2004
Springer
15 years 5 months ago
Online Scheduling with Bounded Migration
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...
Peter Sanders, Naveen Sivadasan, Martin Skutella
86
Voted
HICSS
2003
IEEE
155views Biometrics» more  HICSS 2003»
15 years 5 months ago
No More Shadow Boxing with Online Music Piracy: Strategic Business Models to Enhance Revenues
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...
Sudip Bhattacharjee, Ram D. Gopal, Kaveepan Lertwa...
COMPGEOM
1992
ACM
15 years 4 months ago
On-Line Steiner Trees in the Euclidean Plane
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...
Noga Alon, Yossi Azar