語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Theory of Evolutionary Computation =...
~
SpringerLink (Online service)
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 /
其他作者:
Neumann, Frank.
面頁冊數:
XII, 506 p. 27 illus., 17 illus. in color.online resource. :
Contained By:
Springer Nature eBook
標題:
Operations Research/Decision Theory. -
電子資源:
https://doi.org/10.1007/978-3-030-29414-4
ISBN:
9783030294144
Theory of Evolutionary Computation = Recent Developments in Discrete Optimization /
Theory of Evolutionary Computation
Recent Developments in Discrete Optimization /[electronic resource] :edited by Benjamin Doerr, Frank Neumann. - 1st ed. 2020. - XII, 506 p. 27 illus., 17 illus. in color.online resource. - 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:
669176
Operations Research/Decision Theory.
LC Class. No.: QA75.5-76.95
Dewey Class. No.: 004.0151
Theory of Evolutionary Computation = Recent Developments in Discrete Optimization /
LDR
:03789nam a22004335i 4500
001
1023191
003
DE-He213
005
20200629210814.0
007
cr nn 008mamaa
008
210318s2020 gw | s |||| 0|eng d
020
$a
9783030294144
$9
978-3-030-29414-4
024
7
$a
10.1007/978-3-030-29414-4
$2
doi
035
$a
978-3-030-29414-4
050
4
$a
QA75.5-76.95
050
4
$a
QA76.63
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
245
1 0
$a
Theory of Evolutionary Computation
$h
[electronic resource] :
$b
Recent Developments in Discrete Optimization /
$c
edited by Benjamin Doerr, Frank Neumann.
250
$a
1st ed. 2020.
264
1
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2020.
300
$a
XII, 506 p. 27 illus., 17 illus. in color.
$b
online resource.
336
$a
text
$b
txt
$2
rdacontent
337
$a
computer
$b
c
$2
rdamedia
338
$a
online resource
$b
cr
$2
rdacarrier
347
$a
text file
$b
PDF
$2
rda
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
2 4
$a
Operations Research/Decision Theory.
$3
669176
650
2 4
$a
Optimization.
$3
669174
650
2 4
$a
Artificial Intelligence.
$3
646849
650
1 4
$a
Theory of Computation.
$3
669322
650
0
$a
Decision making.
$3
528319
650
0
$a
Operations research.
$3
573517
650
0
$a
Mathematical optimization.
$3
527675
650
0
$a
Artificial intelligence.
$3
559380
650
0
$a
Computers.
$3
565115
700
1
$a
Neumann, Frank.
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1069592
700
1
$a
Doerr, Benjamin.
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
837097
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
776
0 8
$i
Printed edition:
$z
9783030294137
776
0 8
$i
Printed edition:
$z
9783030294151
776
0 8
$i
Printed edition:
$z
9783030294168
830
0
$a
Natural Computing Series,
$x
1619-7127
$3
1256952
856
4 0
$u
https://doi.org/10.1007/978-3-030-29414-4
912
$a
ZDB-2-SCS
912
$a
ZDB-2-SXCS
950
$a
Computer Science (SpringerNature-11645)
950
$a
Computer Science (R0) (SpringerNature-43710)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入