214,02 €
251,79 €
Adaptive Differential Evolution
214,02 € 
- Išsiųsime per 10–14 d.d.
I ?rst met Jingqiao when he had just commenced his PhD research in evolutionary algorithms with Arthur Sanderson at Rensselaer. Jingqiao's goals then were the investigation and development of a novel class of se- adaptivedi?erentialevolutionalgorithms, later calledJADE. I had remarked to Jingqiao then that Arthur always appreciated strong theoretical foun- tions in his research, so Jingqiao's prior mathematically rigorous work in communications systems would be very useful experience. Later in…
214.02
2025-07-06 23:59:00
/https://libri-media.knygos-static.lt/1c9dedbb-f443-4592-a8a3-a3e732fb394e/1)
- Autorius: Jingqiao Zhang, Arthur C. Sanderson
- Leidėjas: Springer-Verlag GmbH
- Metai: 2009
- ISBN-10: 3642015263
- ISBN-13: 9783642015267
- Formatas: 16.6 x 23.9 x 2 cm, kieti viršeliai
- Kalba: Anglų
- Extra -15 % nuolaida šiai knygai su kodu: ENG15
Adaptive Differential Evolution + nemokamas atvežimas! | knygos.lt
Atsiliepimai
Aprašymas
I ?rst met Jingqiao when he had just commenced his PhD research in evolutionary algorithms with Arthur Sanderson at Rensselaer. Jingqiao's goals then were the investigation and development of a novel class of se- adaptivedi?erentialevolutionalgorithms, later calledJADE. I had remarked to Jingqiao then that Arthur always appreciated strong theoretical foun- tions in his research, so Jingqiao's prior mathematically rigorous work in communications systems would be very useful experience. Later in 2007, whenJingqiaohadcompletedmostofthetheoreticalandinitialexperimental work on JADE, I invited him to spend a year at GE Global Research where he applied his developments to several interesting and important real-world problems. Most evolutionary algorithm conferences usually have their share of in- vative algorithm oriented papers which seek to best the state of the art - gorithms. The best algorithms of a time-frame create a foundation for a new generationof innovativealgorithms, and so on, fostering a meta-evolutionary search for superior evolutionary algorithms. In the past two decades, during whichinterest andresearchin evolutionaryalgorithmshavegrownworldwide by leaps and bounds, engaging the curiosity of researchers and practitioners frommanydiversescienceandtechnologycommunities, developingstand-out algorithms is getting progressively harder.EXTRA 15 % nuolaida
214,02 €
251,79 €
Išsiųsime per 10–14 d.d.
Kupono kodas: ENG15
Akcija baigiasi už 6d.23:38:36
Nuolaidos kodas galioja perkant nuo 10 €. Nuolaidos nesumuojamos.
- Autorius: Jingqiao Zhang, Arthur C. Sanderson
- Leidėjas: Springer-Verlag GmbH
- Metai: 2009
- ISBN-10: 3642015263
- ISBN-13: 9783642015267
- Formatas: 16.6 x 23.9 x 2 cm, kieti viršeliai
- Kalba: Anglų
I ?rst met Jingqiao when he had just commenced his PhD research in evolutionary algorithms with Arthur Sanderson at Rensselaer. Jingqiao's goals then were the investigation and development of a novel class of se- adaptivedi?erentialevolutionalgorithms, later calledJADE. I had remarked to Jingqiao then that Arthur always appreciated strong theoretical foun- tions in his research, so Jingqiao's prior mathematically rigorous work in communications systems would be very useful experience. Later in 2007, whenJingqiaohadcompletedmostofthetheoreticalandinitialexperimental work on JADE, I invited him to spend a year at GE Global Research where he applied his developments to several interesting and important real-world problems. Most evolutionary algorithm conferences usually have their share of in- vative algorithm oriented papers which seek to best the state of the art - gorithms. The best algorithms of a time-frame create a foundation for a new generationof innovativealgorithms, and so on, fostering a meta-evolutionary search for superior evolutionary algorithms. In the past two decades, during whichinterest andresearchin evolutionaryalgorithmshavegrownworldwide by leaps and bounds, engaging the curiosity of researchers and practitioners frommanydiversescienceandtechnologycommunities, developingstand-out algorithms is getting progressively harder.
Atsiliepimai