Sciweavers

1292 search results - page 32 / 259
» Revisiting the optimal scheduling problem
Sort
View
RTSS
1999
IEEE
14 years 23 days ago
Optimal Reward-Based Scheduling of Periodic Real-Time Tasks
Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and a...
Hakan Aydin, Rami G. Melhem, Daniel Mossé, ...
HEURISTICS
2006
197views more  HEURISTICS 2006»
13 years 8 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
IPPS
2006
IEEE
14 years 2 months ago
An optimal approach to the task allocation problem on hierarchical architectures
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
Alexander Metzner, Martin Fränzle, Christian ...
HIS
2009
13 years 6 months ago
Scheduling Meta-Tasks in Distributed Heterogeneous Computing Systems: A Meta-Heuristic Particle Swarm Optimization Approach
Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In ...
Hesam Izakian, Ajith Abraham, Václav Sn&aac...
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
13 years 10 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz