Sciweavers

4451 search results - page 750 / 891
» On Random Ordering Constraints
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
14 years 1 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
CCGRID
2004
IEEE
14 years 1 months ago
Surfer: an extensible pull-based framework for resource selection and ranking
Grid computing aims to connect large numbers of geographically and organizationally distributed resources to increase computational power, resource utilization, and resource acces...
Paul Z. Kolano
CGO
2004
IEEE
14 years 1 months ago
Exploring Code Cache Eviction Granularities in Dynamic Optimization Systems
Dynamic optimization systems store optimized or translated code in a software-managed code cache in order to maximize reuse of transformed code. Code caches store superblocks that...
Kim M. Hazelwood, James E. Smith
ATAL
2006
Springer
14 years 1 months ago
Adaptive distributed resource allocation and diagnostics using cooperative information-sharing strategies
A major challenge in efficiently solving distributed resource allocation problems is to cope with the dynamic state changes that characterise such systems. An effective solution t...
Partha Sarathi Dutta, Nicholas R. Jennings, Luc Mo...
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
14 years 1 months ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...