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

Name: Reactive Search Optimization: Optimization, Local Search, Heuristic, Tabu Simulated Annealing, Global Genetic Algorithm, Maxima and Minima, Function of a Real Variable
SKU: 809f241c2f88f32fa2aba086e11b1f42
Price: 116 EUR
Availability: InStock

1/1

Prijzen vanaf

116,00

Uitgelicht

	116,00	Naar shop
VERGELIJK ALLE AANBIEDERS (1)

Beschrijving

Bol 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.

Lees meer

Vergelijk aanbieders (1)

Sorteren op:

€ 116,00 Gratis verzending

Beschrijving (1)

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.

Lees meer