Sciweavers

297 search results - page 36 / 60
» Descending Deviation Optimization techniques for scheduling ...
Sort
View
EAAI
2008
101views more  EAAI 2008»
13 years 7 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck
CAMAD
2006
IEEE
13 years 11 months ago
Improving quality of service for switched processing systems
Switched Processing Systems (SPS) capture the essence of a fundamental resource allocation problem in many modern communication, computer and manufacturing systems involving hetero...
Ying-Chao Hung, George Michailidis
AAAI
2007
13 years 10 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
EMSOFT
2001
Springer
14 years 1 days ago
Compiler Optimizations for Adaptive EPIC Processors
Abstract. Advances in VLSI technology have lead to a tremendous increase in the density and number of devices that can be manufactured in a single microchip. One of the interesting...
Krishna V. Palem, Surendranath Talla, Weng-Fai Won...
INFOCOM
2008
IEEE
14 years 1 months ago
On the Throughput Capacity of Opportunistic Multicasting with Erasure Codes
— In this paper, we concentrate on opportunistic scheduling for multicast information. We pose the problem as a multicast throughput optimization problem. As a solution we presen...
Ulas C. Kozat