Fireworks algorithm: Difference between revisions
Content deleted Content added
Ketiltrout (talk | contribs) m Ketiltrout moved page Fireworks Algorithm to Fireworks algorithm |
removed Category:Algorithms and data structures; added Category:Optimization algorithms and methods using HotCat |
||
| Line 4: | Line 4: | ||
* [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/] |
||
[[Category: |
[[Category:Optimization algorithms and methods]] |
||
{{algorithm-stub}} |
{{algorithm-stub}} |
||
Revision as of 17:03, 22 October 2016
In general 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. |