Sciweavers

203 search results - page 23 / 41
» Improved undecidability results on weighted timed automata
Sort
View
DSN
2009
IEEE
14 years 2 months ago
Maximizing system lifetime by battery scheduling
The use of mobile devices is limited by the battery lifetime. Some devices have the option to connect an extra battery, or to use smart battery-packs with multiple cells to extend...
Marijn R. Jongerden, Boudewijn R. Haverkort, Henri...
ICASSP
2011
IEEE
12 years 11 months ago
Progress in example based automatic speech recognition
In this paper we present a number of improvements that were recently made to the template based speech recognition system developed at ESAT. Combining these improvements resulted ...
Kris Demuynck, Dino Seppi, Hugo Van hamme, Dirk Va...
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 7 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
WAOA
2004
Springer
132views Algorithms» more  WAOA 2004»
14 years 23 days ago
Stochastic Online Scheduling on Parallel Machines
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
Nicole Megow, Marc Uetz, Tjark Vredeveld
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 8 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz