Sciweavers

11 search results - page 2 / 3
» Iterative Relaxations for Iterative Flattening in Cumulative...
Sort
View
DATE
2007
IEEE
167views Hardware» more  DATE 2007»
13 years 11 months ago
A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multip
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
Nadathur Satish, Kaushik Ravindran, Kurt Keutzer
IJHIS
2007
89views more  IJHIS 2007»
13 years 5 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
ANOR
2008
171views more  ANOR 2008»
13 years 5 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
INFOCOM
2008
IEEE
13 years 12 months ago
A Distributed Optimization Algorithm for Multi-Hop Cognitive Radio Networks
Cognitive radio (CR) is a revolution in radio technology and is viewed as an enabling technology for dynamic spectrum access. This paper investigates how to design distributed alg...
Yi Shi, Y. Thomas Hou
CC
2007
Springer
13 years 11 months ago
Preprocessing Strategy for Effective Modulo Scheduling on Multi-issue Digital Signal Processors
To achieve high resource utilization for multi-issue Digital Signal Processors (DSPs), production compilers commonly include variants of the iterative modulo scheduling algorithm. ...
Doosan Cho, Ravi Ayyagari, Gang-Ryung Uh, Yunheung...