Jump to content

Fireworks algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michipedian (talk | contribs) at 18:31, 29 July 2018 (clean up). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Fireworks_algorithm&oldid=852543360"