Sciweavers

626 search results - page 25 / 126
» Scheduling as Rule Composition
Sort
View
SERVICES
2008
109views more  SERVICES 2008»
13 years 9 months ago
Specifying Flexible Charging Rules for Composable Services
Where services are offered on a commercial basis, the manner in which charges for service usage are calculated is of key importance. Services typically have associated with them a...
Brendan Jennings, Lei Xu, Eamonn de Leastar
IPPS
2008
IEEE
14 years 2 months ago
A genetic programming approach to solve scheduling problems with parallel simulation
—Scheduling and dispatching are two ways of solving production planning problems. In this work, based on preceding works, it is explained how these two approaches can be combined...
Andreas Beham, Stephan M. Winkler, Stefan Wagner 0...
EOR
2008
91views more  EOR 2008»
13 years 7 months ago
Dominance-based heuristics for one-machine total cost scheduling problems
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...
ISCC
2000
IEEE
106views Communications» more  ISCC 2000»
14 years 5 days ago
Packet Scheduling Based on Learning in the Next Generation Internet Architectures
With multimedia applications, the Internet traffic increased a lot in volume, but also suffered major alterations in its nature, requesting other network services besides the curr...
Alencar de Melo Jr., Juan Manuel Adán Coell...
PDSE
1998
108views more  PDSE 1998»
13 years 9 months ago
An Algebraic Framework for Optimizing Parallel Programs
This paper proposes a theoretical framework for verifying and deriving code optimizations for programs written in parallel programming languages. The key idea of this framework is...
Ichiro Satoh