東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Theory of evolutionary computation =...

Doerr, Benjamin.

FindBook

Google Book

Amazon

博客來

Theory of evolutionary computation = recent developments in discrete optimization /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Theory of evolutionary computation/ edited by Benjamin Doerr, Frank Neumann.
其他題名:	recent developments in discrete optimization /
其他作者:	Doerr, Benjamin.
出版者:	Cham :Springer International Publishing : : 2020.,
面頁冊數:	xii, 506 p. :ill. (some col.), digital ;24 cm.
內容註:	Probabilistic Tools for the Analysis of Randomized Optimization Heuristics -- Drift Analysis -- Complexity Theory for Discrete Black-Box Optimization Heuristics -- Parameterized Complexity Analysis of Randomized Search Heuristics -- Analysing Stochastic Search Heuristics Operating on a Fixed Budget -- Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices -- Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments -- The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses -- Theory of Estimation-of-Distribution Algorithms -- Theoretical Foundations of Immune-Inspired Randomized Search Heuristics for Optimization -- Computational Complexity Analysis of Genetic Programming.
Contained By:	Springer eBooks
標題:	Evolutionary computation. -
電子資源:	https://doi.org/10.1007/978-3-030-29414-4
ISBN:	9783030294144

Theory of evolutionary computation = recent developments in discrete optimization /
Theory of evolutionary computationrecent developments in discrete optimization /[electronic resource] :edited by Benjamin Doerr, Frank Neumann. - Cham :Springer International Publishing :2020. - xii, 506 p. :ill. (some col.), digital ;24 cm. - Natural computing series,1619-7127. - Natural computing series..

Probabilistic Tools for the Analysis of Randomized Optimization Heuristics -- Drift Analysis -- Complexity Theory for Discrete Black-Box Optimization Heuristics -- Parameterized Complexity Analysis of Randomized Search Heuristics -- Analysing Stochastic Search Heuristics Operating on a Fixed Budget -- Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices -- Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments -- The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses -- Theory of Estimation-of-Distribution Algorithms -- Theoretical Foundations of Immune-Inspired Randomized Search Heuristics for Optimization -- Computational Complexity Analysis of Genetic Programming.

This edited book reports on recent developments in the theory of evolutionary computation, or more generally the domain of randomized search heuristics. It starts with two chapters on mathematical methods that are often used in the analysis of randomized search heuristics, followed by three chapters on how to measure the complexity of a search heuristic: black-box complexity, a counterpart of classical complexity theory in black-box optimization; parameterized complexity, aimed at a more fine-grained view of the difficulty of problems; and the fixed-budget perspective, which answers the question of how good a solution will be after investing a certain computational budget. The book then describes theoretical results on three important questions in evolutionary computation: how to profit from changing the parameters during the run of an algorithm; how evolutionary algorithms cope with dynamically changing or stochastic environments; and how population diversity influences performance. Finally, the book looks at three algorithm classes that have only recently become the focus of theoretical work: estimation-of-distribution algorithms; artificial immune systems; and genetic programming. Throughout the book the contributing authors try to develop an understanding for how these methods work, and why they are so successful in many applications. The book will be useful for students and researchers in theoretical computer science and evolutionary computing.

ISBN: 9783030294144

Standard No.: 10.1007/978-3-030-29414-4doiSubjects--Topical Terms:

582189
Evolutionary computation.

LC Class. No.: TA347.E96 / T44 2020

Dewey Class. No.: 004.0151

Theory of evolutionary computation = recent developments in discrete optimization /
LDR:03394nmm a2200349 a 4500 001 2214509
003 DE-He213
005 20191121041440.0
006 m d
007 cr nn 008maaau
008 201118s2020 gw s 0 eng d
020 $a 9783030294144 $q (electronic bk.)
020 $a 9783030294137 $q (paper)
024 7 $a 10.1007/978-3-030-29414-4 $2 doi
035 $a 978-3-030-29414-4
040 $a GP $c GP
041 0 $a eng
050 4 $a TA347.E96 $b T44 2020
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
090 $a TA347.E96 $b T396 2020
245 0 0 $a Theory of evolutionary computation $h [electronic resource] : $b recent developments in discrete optimization / $c edited by Benjamin Doerr, Frank Neumann.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xii, 506 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Natural computing series, $x 1619-7127
505 0 $a Probabilistic Tools for the Analysis of Randomized Optimization Heuristics -- Drift Analysis -- Complexity Theory for Discrete Black-Box Optimization Heuristics -- Parameterized Complexity Analysis of Randomized Search Heuristics -- Analysing Stochastic Search Heuristics Operating on a Fixed Budget -- Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices -- Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments -- The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses -- Theory of Estimation-of-Distribution Algorithms -- Theoretical Foundations of Immune-Inspired Randomized Search Heuristics for Optimization -- Computational Complexity Analysis of Genetic Programming.
520 $a This edited book reports on recent developments in the theory of evolutionary computation, or more generally the domain of randomized search heuristics. It starts with two chapters on mathematical methods that are often used in the analysis of randomized search heuristics, followed by three chapters on how to measure the complexity of a search heuristic: black-box complexity, a counterpart of classical complexity theory in black-box optimization; parameterized complexity, aimed at a more fine-grained view of the difficulty of problems; and the fixed-budget perspective, which answers the question of how good a solution will be after investing a certain computational budget. The book then describes theoretical results on three important questions in evolutionary computation: how to profit from changing the parameters during the run of an algorithm; how evolutionary algorithms cope with dynamically changing or stochastic environments; and how population diversity influences performance. Finally, the book looks at three algorithm classes that have only recently become the focus of theoretical work: estimation-of-distribution algorithms; artificial immune systems; and genetic programming. Throughout the book the contributing authors try to develop an understanding for how these methods work, and why they are so successful in many applications. The book will be useful for students and researchers in theoretical computer science and evolutionary computing.
650 0 $a Evolutionary computation. $3 582189
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Artificial Intelligence. $3 769149
650 2 4 $a Optimization. $3 891104
650 2 4 $a Operations Research/Decision Theory. $3 890895
700 1 $a Doerr, Benjamin. $3 1572844
700 1 $a Neumann, Frank. $3 1245677
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Natural computing series. $3 2057566
856 4 0 $u https://doi.org/10.1007/978-3-030-29414-4
950 $a Computer Science (Springer-11645)