Sciweavers

28 search results - page 3 / 6
» Forward Analysis for WSTS, Part I: Completions
Sort
View
IOR
2002
135views more  IOR 2002»
13 years 5 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
ATAL
2006
Springer
13 years 9 months ago
Failures of the VCG mechanism in combinatorial auctions and exchanges
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
Vincent Conitzer, Tuomas Sandholm
ISMB
1994
13 years 7 months ago
GeneQuiz: A Workbench for Sequence Analysis
Wepresent the prototype of a software system, cMledGeneQuiz,for large-scale biological sequence analysis. The system was designed to meet the needs that arise in computational seq...
Michael Scharf, Reinhard Schneider, Georg Casari, ...
EUROSYS
2009
ACM
14 years 2 months ago
Migrating server storage to SSDs: analysis of tradeoffs
Recently, flash-based solid-state drives (SSDs) have become standard options for laptop and desktop storage, but their impact on enterprise server storage has not been studied. P...
Dushyanth Narayanan, Eno Thereska, Austin Donnelly...
FSTTCS
2007
Springer
13 years 12 months ago
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b  2. The aim is to nd a minimum weight spannin...
Anand Srivastav, Sören Werth