Sciweavers

16596 search results - page 240 / 3320
» Generalized Assignment Problems
Sort
View
ICALP
2003
Springer
15 years 12 months ago
Online Load Balancing Made Simple: Greedy Strikes Back
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia...
RTSS
2000
IEEE
15 years 11 months ago
Enhanced Fixed-Priority Scheduling with (m, k)-Firm Guarantee
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
Gang Quan, Xiaobo Sharon Hu
CIKM
2006
Springer
15 years 10 months ago
Adaptive non-linear clustering in data streams
Data stream clustering has emerged as a challenging and interesting problem over the past few years. Due to the evolving nature, and one-pass restriction imposed by the data strea...
Ankur Jain, Zhihua Zhang, Edward Y. Chang
GECCO
2006
Springer
190views Optimization» more  GECCO 2006»
15 years 10 months ago
Effective genetic approach for optimizing advanced planning and scheduling in flexible manufacturing system
In this paper, a novel approach for designing chromosome has been proposed to improve the effectiveness, which called multistage operation-based genetic algorithm (moGA). The obje...
Haipeng Zhang, Mitsuo Gen
CAV
2010
Springer
190views Hardware» more  CAV 2010»
15 years 10 months ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...