Sciweavers

3499 search results - page 398 / 700
» On the local optimality of LambdaRank
Sort
View
EVOW
2009
Springer
15 years 11 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
EUROGP
1999
Springer
166views Optimization» more  EUROGP 1999»
15 years 11 months ago
Adapting the Fitness Function in GP for Data Mining
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
Jeroen Eggermont, A. E. Eiben, Jano I. van Hemert
PPSN
1998
Springer
15 years 11 months ago
Restart Scheduling for Genetic Algorithms
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
Alex S. Fukunaga
ISLPED
1997
ACM
95views Hardware» more  ISLPED 1997»
15 years 11 months ago
Formalized methodology for data reuse exploration in hierarchical memory mappings
Efficient use of an optimized memory hierarchy to exploit temporal locality in the memory accesses on array signals can have a very large impact on the power consumption in data ...
Jean-Philippe Diguet, Sven Wuytack, Francky Cattho...
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 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