Fireworks algorithm: Difference between revisions
Content deleted Content added
remove dead external links and change them to appropriate links |
|||
| Line 2: | Line 2: | ||
==External links== |
==External links== |
||
* [http://www.cil.pku.edu.cn/research/ |
* [http://www.cil.pku.edu.cn/research/swgence/271228.htm Fireworks Algorithm] |
||
* [http://www.cil.pku.edu.cn |
* [http://www.cil.pku.edu.cn Computational Intelligence Laboratory, Peking University] |
||
* [http://www.cil.pku.edu.cn] |
|||
[[Category:Optimization algorithms and methods]] |
[[Category:Optimization algorithms and methods]] |
||
Revision as of 10:32, 13 June 2019
The Fireworks Algorithm (FWA) is an approach to exploring a very large solution space by choosing a set of random points confined by some distance metric in the hopes that one or more of them will yield promising results, allowing for a more concentrated search nearby.
External links
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |