Sciweavers

501 search results - page 51 / 101
» Scheduling Abstractions for Local Search
Sort
View
ANOR
2007
166views more  ANOR 2007»
15 years 1 months ago
Memetic particle swarm optimization
Abstract We propose a new Memetic Particle Swarm Optimization scheme that incorporates local search techniques in the standard Particle Swarm Optimization algorithm, resulting in a...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
INFOCOM
2007
IEEE
15 years 7 months ago
Losing Opportunism: Evaluating Service Integration in an Opportunistic Wireless System
Abstract— In this paper we evaluate interactions among flowlevel performance metrics when integrating QoS and best effort flows in a wireless system using opportunistic schedul...
Hongseok Kim, Gustavo de Veciana
ANOR
2007
108views more  ANOR 2007»
15 years 1 months ago
Towards a practical engineering tool for rostering
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...
Edward P. K. Tsang, John A. Ford, Patrick Mills, R...
ANOR
2007
80views more  ANOR 2007»
15 years 1 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
CORR
2007
Springer
131views Education» more  CORR 2007»
15 years 1 months ago
How to use the Scuba Diving metaphor to solve problem with neutrality ?
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...
Philippe Collard, Sébastien Vérel, M...