Donald Davendra – författare
Visar alla böcker från författaren Donald Davendra. Handla med fri frakt och snabb leverans.
7 produkter
Novel Trends in the Traveling Salesman Problem
Av Donald Davendra, Magdalena Bialic-Davendra
Inbunden, 2020
1441 kr
Lägg i varukorg
Self-Organizing Migrating Algorithm
Methodology and Implementation
Av Donald Davendra, Ivan Zelinka
Inbunden, 2016
1082 kr
Lägg i varukorg
This book brings together the current stateof-the-art research in Self Organizing Migrating Algorithm (SOMA) as a novelpopulation-based evolutionary algorithm, modeled on the predator-preyrelationship, by its leading practitioners. As the first ever book on SOMA, this book isgeared towards graduate …
Self-Organizing Migrating Algorithm
Methodology and Implementation
Av Ivan Zelinka, Donald Davendra
E-bok, 2016
1427 kr
Lägg i varukorg
This book brings together the current stateof-the-art research in Self Organizing Migrating Algorithm (SOMA) as a novelpopulation-based evolutionary algorithm, modeled on the predator-preyrelationship, by its leading practitioners. As the first ever book on SOMA, this book isgeared towards graduate …
Self-Organizing Migrating Algorithm
Methodology and Implementation
Av Donald Davendra, Ivan Zelinka
Häftad, 2018
1082 kr
Lägg i varukorg
This book brings together the current stateof-the-art research in Self Organizing Migrating Algorithm (SOMA) as a novelpopulation-based evolutionary algorithm, modeled on the predator-preyrelationship, by its leading practitioners. As the first ever book on SOMA, this book isgeared towards graduate …
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization
Av Godfrey C. Onwubolu, Donald Davendra
2009
1278 kr
Lägg i varukorg
What is combinatorial optimization? Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both ?nite and discrete, i. e. , enumerable. For example, the traveling salesman problem asks in what order a salesman should visit the cities in his territory if he …
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization
Av Donald Davendra, Godfrey C. Onwubolu
E-bok, 2008
1416 kr
Lägg i varukorg
What is combinatorial optimization? Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both ?nite and discrete, i. e. , enumerable. For example, the traveling salesman problem asks in what order a salesman should visit the cities in his territory if he …
