Fireworks algorithm: Difference between revisions

Content deleted Content added

Inline

Revision as of 06:13, 31 December 2018

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.

External links

http://www.cil.pku.edu.cn/research/fa/

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

Revision as of 05:48, 31 December 2018 edit 121.200.54.2 (talk) No edit summary Tag: Visual edit ← Previous edit		Revision as of 06:13, 31 December 2018 edit undo 121.200.54.2 (talk) No edit summary Tag: Visual edit Next edit →
Line 1:		Line 1:
	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.		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.

	==External links==		==External links==