Fireworks algorithm: Difference between revisions
Content deleted Content added
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
The '''Fireworks Algorithm''' 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. |
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== |
==External links== |
||
Revision as of 06:15, 31 December 2018
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. |