Artículos relacionados a Reactive Search Optimization: Optimization, Local Search,...

Reactive Search Optimization: Optimization, Local Search, Heuristic, Tabu Search, Simulated Annealing, Global Optimization, Genetic Algorithm, Maxima and Minima, Function of a Real Variable - Tapa blanda

 
9786130345914: Reactive Search Optimization: Optimization, Local Search, Heuristic, Tabu Search, Simulated Annealing, Global Optimization, Genetic Algorithm, Maxima and Minima, Function of a Real Variable

Sinopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Reactive search optimization (RSO) is the common name for a family of optimization algorithms based on the local search techniques. It refers to a class of heuristics that automatically adjust their working parameters during the optimization phase. Reactive search optimization (RSO), like all local search techniques, is applied to the problem of finding the optimal configuration of a system; such configuration is usually composed of continuously or discretely varying parameters, while the optimality criterion is a numerical value associated to each configuration. In most cases, an optimization problem can be reduced to finding the (global) minimum of a function whose arguments are the configuration parameters, seen as free variables in the function''s domain space.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Reactive search optimization (RSO) is the common name for a family of optimization algorithms based on the local search techniques. It refers to a class of heuristics that automatically adjust their working parameters during the optimization phase. Reactive search optimization (RSO), like all local search techniques, is applied to the problem of finding the optimal configuration of a system; such configuration is usually composed of continuously or discretely varying parameters, while the optimality criterion is a numerical value associated to each configuration. In most cases, an optimization problem can be reduced to finding the (global) minimum of a function whose arguments are the configuration parameters, seen as free variables in the function''s domain space.

"Sobre este título" puede pertenecer a otra edición de este libro.