Sciweavers

471 search results - page 29 / 95
» Case studies for self-organization in computer science
Sort
View
TCS
2010
13 years 7 months ago
Randomized priority algorithms
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
Spyros Angelopoulos, Allan Borodin
FOCS
2008
IEEE
14 years 3 months ago
Multi-unit Auctions with Budget Limits
We study multi-unit auctions where the bidders have a budget constraint, a situation very common in practice that has received relatively little attention in the auction theory li...
Shahar Dobzinski, Ron Lavi, Noam Nisan
STACS
2004
Springer
14 years 2 months ago
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
Tomás Ebenlendr, Jiri Sgall
ACE
2004
186views Education» more  ACE 2004»
13 years 10 months ago
Five Myths of Assessment
This paper describes some issues concerning assessment and the corresponding motivation for students to work in a desired manner. The issues came from studying assessment in the R...
Mats Daniels, Anders Berglund, Arnold Neville Pear...
DAM
2008
103views more  DAM 2008»
13 years 9 months ago
Crown reductions for the Minimum Weighted Vertex Cover problem
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...
Miroslav Chlebík, Janka Chlebíkov&aa...