Sciweavers

247 search results - page 9 / 50
» Optimal Preemptive Scheduling for General Target Functions
Sort
View
TOG
2012
230views Communications» more  TOG 2012»
11 years 9 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
14 years 19 hour ago
Variable size population for dynamic optimization with genetic programming
A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. pro...
Leonardo Vanneschi, Giuseppe Cuccu
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
13 years 8 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
PE
2002
Springer
207views Optimization» more  PE 2002»
13 years 7 months ago
Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline
Priority scheduling for packets is becoming a hot topic, as attemps are being made to integrate voice services in existing data networks. In this paper, we consider a discrete-tim...
Joris Walraevens, Bart Steyaert, Herwig Bruneel
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 7 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat