Sciweavers

3320 search results - page 175 / 664
» Heuristics for the Phylogeny Problem
Sort
View
GECCO
2006
Springer
184views Optimization» more  GECCO 2006»
15 years 10 months ago
Genetic algorithms and mixed integer linear programs for optimal strategies in a student's "sports" activity
This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...
Thomas Butter, Franz Rothlauf, Jörn Grahl, To...
CCCG
2001
15 years 8 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
SCHEDULING
2010
57views more  SCHEDULING 2010»
15 years 1 months ago
Scheduling technicians and tasks in a telecommunications company
This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a large telecommunicatio...
Jean-François Cordeau, Gilbert Laporte, Fed...
IDA
2008
Springer
15 years 6 months ago
A comprehensive analysis of hyper-heuristics
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
Ender Özcan, Burak Bilgin, Emin Erkan Korkmaz
MICRO
2006
IEEE
132views Hardware» more  MICRO 2006»
16 years 19 days ago
Data-Dependency Graph Transformations for Superblock Scheduling
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
Mark Heffernan, Kent D. Wilken, Ghassan Shobaki