Listar LCC - Artículos por autor "Whitley, L. Darrell"
Mostrando ítems 1-5 de 5
-
A methodology to find the elementary landscape decomposition of combinatorial optimization problems
A small number of combinatorial optimization problems have search spaces that correspond to elementary landscapes, where the objective function f is an eigenfunction of the Laplacian that describes the neighborhood structure ... -
Elementary landscape decomposition of the frequency assignment problem
Chicano-García, José-Francisco
; Whitley, L. Darrell; Alba-Torres, Enrique; Luna, Francisco (2014-09-30)
The Frequency Assignment Problem (FAP) is an important problem that arises in the design of radio networks, when a channel has to be assigned to each transceiver of the network. This problem is a generalization of the graph ... -
Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation
Uniform crossover and bit-flip mutation are two popular operators used in genetic algorithms to generate new solutions in an iteration of the algorithm when the solutions are represented by binary strings. We use the Walsh ... -
Fitness function distributions over generalized search neighborhoods in the q-ary hypercube
Sutton, Andrew M.; Chicano-García, José-Francisco; Whitley, L. Darrell (2014-10-03)
The frequency distribution of a fitness function over regions of its domain is an important quantity for understanding the behavior of algorithms that employ randomized sampling to search the function. In general, exactly ... -
The component model for elementary landscapes and partial neighborhoods
Whitley, L. Darrell; Sutton, Andrew M.; Ochoa, Gabriela; Chicano-García, José-Francisco (2014-09-29)
Local search algorithms exploit moves on an adjacency graph of the search space. An “elementary landscape” exists if the objective function f is an eigenfunction of the Laplacian of the graph induced by the neighborhood ...