Sciweavers

501 search results - page 31 / 101
» Scheduling Abstractions for Local Search
Sort
View
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 9 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...
STACS
2005
Springer
15 years 8 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
OOPSLA
2010
Springer
15 years 1 months ago
Encapsulation and locality: a foundation for concurrency support in multi-language virtual machines?
We propose to search for common abstractions for different concurrency models to enable high-level language virtual machines to support a wide range of different concurrency model...
Stefan Marr
RTSS
2006
IEEE
15 years 9 months ago
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
We present an optimal real-time scheduling algorithm for multiprocessors — one that satisfies all task deadlines, when the total utilization demand does not exceed the utilizat...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
ICNP
2009
IEEE
15 years 25 days ago
RASPberry: A Stable Reader Activation Scheduling Protocol in Multi-Reader RFID Systems
Abstract--Recent technological advances have motivated largescale deployment of RFID systems. RFID readers are often static and carefully deployed in a planned manner. However, the...
ShaoJie Tang, Jing Yuan, Xiang-Yang Li, Guihai Che...