Sciweavers

517 search results - page 75 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
INFOCOM
2002
IEEE
15 years 2 months ago
BSFQ: Bin Sort Fair Queueing
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
Shun Yan Cheung, Corneliu S. Pencea
CCGRID
2005
IEEE
15 years 3 months ago
A distributed resource and network partitioning architecture for service grids
Abstract In this paper, we propose the use of a distributed service management architecture for state-of-the-art service-enabled Grids. The architecture is capable of performing au...
Bruno Volckaert, Pieter Thysebaert, Marc De Leenhe...
ISCI
2007
95views more  ISCI 2007»
14 years 9 months ago
Software project management with GAs
A Project Scheduling Problem consists in deciding who does what during the software project lifetime. This is a capital issue in the practice of software engineering, since the to...
Enrique Alba, J. Francisco Chicano
MVA
2002
195views Computer Vision» more  MVA 2002»
14 years 9 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
CORR
2010
Springer
152views Education» more  CORR 2010»
14 years 10 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná