Sciweavers

648 search results - page 3 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
CORR
2004
Springer
122views Education» more  CORR 2004»
13 years 5 months ago
Simple Distributed Weighted Matchings
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
Jaap-Henk Hoepman
COR
2004
146views more  COR 2004»
13 years 5 months ago
An exact algorithm for the robust shortest path problem with interval data
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
Roberto Montemanni, Luca Maria Gambardella
ORL
2008
99views more  ORL 2008»
13 years 5 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
SIGMETRICS
2006
ACM
128views Hardware» more  SIGMETRICS 2006»
13 years 11 months ago
GPS scheduling: selection of optimal weights and comparison with strict priorities
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...
Pascal Lieshout, Michel Mandjes, Sem C. Borst
CPAIOR
2004
Springer
13 years 10 months ago
Simple Rules for Low-Knowledge Algorithm Selection
This paper addresses the question of selecting an algorithm from a predefined set that will have the best performance on a scheduling problem instance. Our goal is to reduce the e...
J. Christopher Beck, Eugene C. Freuder