Sciweavers

2714 search results - page 255 / 543
» Approximation Schemes for Scheduling
Sort
View
ECRTS
2005
IEEE
15 years 10 months ago
Task Assignment on Uniform Heterogeneous Multiprocessors
The partitioning of periodic task systems upon uniform multiprocessors is considered. In the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is a...
Shelby Funk, Sanjoy K. Baruah
IPPS
2003
IEEE
15 years 9 months ago
The Maximal Utilization of Processor Co-Allocation in Multicluster Systems
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
15 years 9 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...
MVA
2002
195views Computer Vision» more  MVA 2002»
15 years 4 months ago
Improved Adaptive Mixture Learning for Robust Video Background Modeling
2 Related Works Gaussian mixtures are often used for data modeling in many real-time applications such as video background modeling and speaker direction tracking. The real-time a...
Dar-Shyang Lee
FLAIRS
2010
15 years 2 months ago
Decision-Theoretic Simulated Annealing
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
Todd W. Neller, Christopher J. La Pilla