Sciweavers

62 search results - page 10 / 13
» Intelligent Backtracking Techniques for Job Shop Scheduling
Sort
View
CSCLP
2004
Springer
14 years 2 days ago
Better Propagation for Non-preemptive Single-Resource Constraint Problems
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
Armin Wolf
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
13 years 10 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
GECCO
2005
Springer
193views Optimization» more  GECCO 2005»
14 years 6 days ago
On the contribution of gene libraries to artificial immune systems
Gene libraries have been added to Artificial Immune Systems in analogy to biological immune systems, but to date no careful study of their effect has been made. This work investig...
Peter Spellward, Tim Kovacs
ECAI
2004
Springer
14 years 2 days ago
Robust Solutions for Constraint Satisfaction and Optimization
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
CEC
2007
IEEE
14 years 1 months ago
Greedy transformation of evolutionary algorithm search spaces for scheduling problems
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...
David Joslin, Justin Collins