Jump to content

Fireworks algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Oshwah (talk | contribs) at 13:28, 29 February 2016 (Reverted edits by Cilatpku (talk): Unexplained removal of content (HG) (3.1.19)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

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=707544048"