Sciweavers

2566 search results - page 19 / 514
» The Online Median Problem
Sort
View
MFCS
1994
Springer
13 years 11 months ago
A Competitive Analysis of the List Update Problem with Lookahead
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
Susanne Albers
ORL
2007
112views more  ORL 2007»
13 years 7 months ago
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of...
Enrico Angelelli, Martin W. P. Savelsbergh, Maria ...
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
13 years 9 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
IADIS
2004
13 years 9 months ago
Multilingual virtual communities - what's the problem?
The paper discusses methods of enabling bi- or multi-lingual people to communicate effectively with each other within one virtual discussion space. The writer's own experimen...
Anita Pincas
AAAI
2012
11 years 10 months ago
Online Task Assignment in Crowdsourcing Markets
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
Chien-Ju Ho, Jennifer Wortman Vaughan