Fireworks algorithm: Difference between revisions
Content deleted Content added
No edit summary |
|||
| Line 3: | Line 3: | ||
==External links== |
==External links== |
||
* [http://www.cil.pku.edu.cn/research/fa/ http://www.cil.pku.edu.cn/research/fa/] |
* [http://www.cil.pku.edu.cn/research/fa/ http://www.cil.pku.edu.cn/research/fa/] |
||
* [http://www.cil.pku.edu.cn/research/fwa/index.html] |
|||
* [http://www.cil.pku.edu.cn] |
|||
[[Category:Optimization algorithms and methods]] |
[[Category:Optimization algorithms and methods]] |
||
Revision as of 03:29, 12 January 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. |