Sciweavers

271 search results - page 2 / 55
» On the Online Unit Clustering Problem
Sort
View
ORL
2002
81views more  ORL 2002»
13 years 6 months ago
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
Leah Epstein, John Noga, Gerhard J. Woeginger
CHI
2011
ACM
12 years 10 months ago
Web workers unite! addressing challenges of online laborers
The ongoing rise of human computation as a means of solving computational problems has created an environment where human workers are often regarded as nameless, faceless computat...
Benjamin B. Bederson, Alexander J. Quinn
CCCG
2003
13 years 8 months ago
Curves of width one and the river shore problem
We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is rela...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
ECCC
2010
80views more  ECCC 2010»
13 years 7 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
14 years 12 days ago
On-Line Windows Scheduling of Temporary Items
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
Wun-Tat Chan, Prudence W. H. Wong