Sciweavers

147 search results - page 23 / 30
» An optimal lower bound for anonymous scheduling mechanisms
Sort
View
MP
2002
85views more  MP 2002»
14 years 11 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
SIGMETRICS
2008
ACM
14 years 11 months ago
Scheduling despite inexact job-size information
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring sm...
Adam Wierman, Misja Nuyens
94
Voted
SIGECOM
2010
ACM
226views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
Auctions with online supply
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
Moshe Babaioff, Liad Blumrosen, Aaron Roth
CORR
2004
Springer
103views Education» more  CORR 2004»
14 years 11 months ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
Esther M. Arkin, Michael A. Bender, Sándor ...
117
Voted
ICALP
2003
Springer
15 years 4 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper