Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Back T., Fogel D.B., Michalewicz Z. — Evolutionary computation (Vol. 1. Basic algorithms and operators)
Back T., Fogel D.B., Michalewicz Z. — Evolutionary computation (Vol. 1. Basic algorithms and operators)



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Evolutionary computation (Vol. 1. Basic algorithms and operators)

Авторы: Back T., Fogel D.B., Michalewicz Z.

Аннотация:

The first volume provides a very broad coverage of the "evolutionary" literature. Reading this first volume will probably save you a lot of time. The evolutionary literature actually becomes quite large these days. The focus of this first volume is on broad coverage, not details although some chapters are already quite advanced.
If you need a fast coverage of the literature in evolutionary computation, this is the book. Pointers to all decisive contributions to the field are there. Reading from cover to cover might be difficult if the purpose is to introduce one to the field, but this is certainly the reference i would suggest to students and researchers new in this field. Each chapter is self-contained and references to the most important works for each chapter is provided at the end of the chapter.


Язык: en

Рубрика: Computer science/Генетика, нейронные сети/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2000

Количество страниц: 339

Добавлена в каталог: 09.11.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Selection methods analytic comparison      224 225
Selection operators      60 167 166—171
Selection operators working mechanisms      166 167
Selection parameters      225
Selection pressure      213 215 219 220 224
Selection probabilities      175
Selection process      see also “Specific processes”
Selection process steps involved      172 187
Selectionist theories      37
Selective pressure      170 171
Self-adaptation      43 83 84 238 241 242 248
Self-adaptation by collective learning      50
Self-adaptation procedures      138
Sequence prediction      43
Set covering problem (SCP)      132
Sex chromosomes      28
Shifting balance theory      36
Shrink mutation operator      248
Shuffle crossover      261
Sigma scaling      174 175
SIMD (small instruction, multiple data) parallel machines      50
Simplex crossover      273
Simplex design      40
Simulated annealing (SA)      196 197
Simulated evolution (SE)      43
Simulation applications      7
Simulations      213 214 218—222
Small instruction, multiple data (SIMD) parallel machines      50
Soft brood selection      202
Solutions      127 128
Source apportionment problem      8
Speciation      36 37
Sperm      27
sphere model      241
Stack genetic programming      109
Staff rota      5
Steady-state genetic algorithms      83 207 208
Steady-state selection      95
Stepping stone model      36
Stimulus-response LCS      118
Stochastic universal sampling (SUS)      176
Strategy parameters      59 137 138
Strength      118
Strict building block hypothesis (SBBH)      70 71 74 75
Structural gene      34
Substitution theorem      193 194
Supersolution      168
Superstrings      199
Supervised learning      114 115
Swap mutation      245 246
Switch mutation operator      248
System identification problems      8
Takeover time      179 180 182 193
Target sampling rates      177 190
Terminals      104
Termination criterion      61
Testing applications      7
Tetraploid      35
Three-dimensional convergent-divergent nozzle      49
Threshold      189
Threshold selection      189 190
Timetables      5
Tournament competition      97
Tournament selection      66 181—186 201 202 215
Tournament selection binary      168
Tournament selection concatenation of tournaments      183
Tournament selection formal description      182
Tournament selection loss of diversity      184
Tournament selection operator      168
Tournament selection parameter settings      182
Tournament selection properties      183—185
Tournament selection working mechanism      181 182
Tournament size      181 184
Transcription process      33 34
Transfer RNA (tRNA)      34
Translation process      34
Transmission probabilities for second-order schemata      268
Transportation problem      4 5
Traveling salesman problem (TSP)      4 43 76 97 139 143 146 147 161 162 240 245 318
Tree-like hierarchies      75
Tree-structured genetic material      107
Tree-structured representation      104
Truncation selection      189 217 218
Two-dimensional foldable plate      81
Two-dimensional packing problems      6
Two-membered ES      48 50
Two-phase nozzle optimization      49
Two-point crossover      267
Uncertainty      3
Unequal-area facility layout problem      6
Uniform crossover      73 85 259 267
Uniform scan operator      27
Variable lifespan      203
Variable-length genotypes      319 320
Variance      208 209
Variation      89
Vehicle routing problem      4 5
Virtual machine design task      105
Watson — Crick model      33
Zero-one knapsack problems      6
Zygote      35
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте