Sciweavers

547 search results - page 42 / 110
» Preference-Based Search for Scheduling
Sort
View
EVOW
2009
Springer
15 years 5 months ago
Binary Exponential Back Off for Tabu Tenure in Hyperheuristics
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
Stephen Remde, Keshav P. Dahal, Peter I. Cowling, ...
85
Voted
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 3 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
CP
2004
Springer
15 years 4 months ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
PUK
2000
15 years 13 days ago
Scheduling in a Planning Environment
In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan....
Antonio Garrido Tejero, Miguel A. Salido, Federico...
ICC
2007
IEEE
121views Communications» more  ICC 2007»
15 years 5 months ago
A Real-Time Hardware-Based Scheduler For Next-Generation Optical Burst Switches
– Optical burst switching (OBS) is a promising technique for next-generation optical switching networks. In traditional OBS, an entire burst is discarded when all output waveleng...
Muhammad T. Anan, Ghulam Chaudhry