| 词条 | Emergent algorithm |
| 释义 |
An emergent algorithm is an algorithm that exhibits emergent behavior. In essence an emergent algorithm implements a set of simple building block behaviors that when combined exhibit more complex behaviors. One example of this is the implementation of fuzzy motion controllers used to adapt robot movement in response to environmental obstacles.[1] An emergent algorithm has the following characteristics: {{dubious|date=May 2013}}
Other examples of emergent algorithms and models include cellular automata,[2] artificial neural networks and swarm intelligence systems (ant colony optimization, bees algorithm, etc.). See also
References1. ^Emergent behaviors of a fuzzy sensory-motor controller evolved by genetic algorithm, Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on (Volume: 31, Issue: 6) {{DEFAULTSORT:Emergent Algorithm}}2. ^{{cite conference | first = Klaus A. | last = Brunner | coauthors = | title = What's emergent in Emergent Computing? | booktitle = Cybernetics and Systems 2002: Proceedings of the 16th European Meeting on Cybernetics and Systems Research | place = Vienna | pages = 189–192 | volume = 1 | url = http://klaus.e175.net/emcsr2002.pdf | accessdate = 2009-02-18 | year = 2002 }} 3 : Emergence|Heuristic algorithms|Algorithms |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。