About: Emergent algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Emergent algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Rule105846932, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FEmergent_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. An emergent algorithm has the following characteristics: * it achieves predictable * it does not require * it does not assume any kind of * it is self-stabilizing

Attributes	Values
rdf:type	software yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Event100029378 yago:Heuristic105847956 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:WikicatHeuristics yago:YagoPermanentlyLocatedEntity yago:Rule105846932
rdfs:label	Emergent algorithm (en) Algorithme émergent (fr) 涌现计算 (zh)
rdfs:comment	Un algorithme émergent est un processus de résolution de problème qui s'appuie sur un ensemble de règles simples pour faire émerger un comportement global plus complexe sans que ce dernier n'ait été explicitement détaillé. Un réseau de neurones artificiels est par exemple constitué d'agents simples, mais c'est leur nombre et leurs interconnexions qui leur permettent de résoudre des problèmes d'ordres de complexité bien supérieurs. (fr) 涌现计算（Emergent computing），是一種包含以下特点的计算： * 它能实现可预计的总体功能。 * 它的整体不要求全部可见，无论是计算者还是对象都无法看到他的全部。 * 它不受任何形式的全局控制（也不可能受到）。 * 它能实现自身稳定。涌现计算被普遍认为是由一系列不确定的独立计算处理进程合作构成的计算过程的总体，既是高等级计算由低等级计算依照复杂的关系组合而成。“云计算”既是涌现计算的一个基本的例子：云计算由无数个基本个体进行运算，各个个体之间并无一个整体调节控制，同时没有人了解整个云计算整体，但是其能稳定的实现一个特殊功能。在自然界中，等整体也符合涌现计算。 (zh) 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. An emergent algorithm has the following characteristics: * it achieves predictable * it does not require * it does not assume any kind of * it is self-stabilizing (en)
dcterms:subject	Emergence Heuristic algorithms Algorithms
Wikipage page ID	214269 (xsd:integer)
Wikipage revision ID	1099203907 (xsd:integer)
Link from a Wikipage to another Wikipage	Bees algorithm Algorithm Ant colony optimization Emergence Emergence Genetic algorithm Artificial neural networks Fuzzy logic Heuristic algorithms Algorithms Heuristic Cellular automata Swarm intelligence Self-stabilization Evolutionary computation dbr:Centralized_control dbr:Global_effect dbr:Global_visibility
sameAs	Emergent algorithm Emergent algorithm Emergent algorithm Emergent algorithm Emergent algorithm Emergent algorithm
dbp:wikiPageUsesTemplate	dbt:Chaos-stub dbt:Dubious
has abstract	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. An emergent algorithm has the following characteristics: * it achieves predictable * it does not require * it does not assume any kind of * it is self-stabilizing Other examples of emergent algorithms and models include cellular automata, artificial neural networks and swarm intelligence systems (ant colony optimization, bees algorithm, etc.). (en) Un algorithme émergent est un processus de résolution de problème qui s'appuie sur un ensemble de règles simples pour faire émerger un comportement global plus complexe sans que ce dernier n'ait été explicitement détaillé. Un réseau de neurones artificiels est par exemple constitué d'agents simples, mais c'est leur nombre et leurs interconnexions qui leur permettent de résoudre des problèmes d'ordres de complexité bien supérieurs. (fr) 涌现计算（Emergent computing），是一種包含以下特点的计算： * 它能实现可预计的总体功能。 * 它的整体不要求全部可见，无论是计算者还是对象都无法看到他的全部。 * 它不受任何形式的全局控制（也不可能受到）。 * 它能实现自身稳定。涌现计算被普遍认为是由一系列不确定的独立计算处理进程合作构成的计算过程的总体，既是高等级计算由低等级计算依照复杂的关系组合而成。“云计算”既是涌现计算的一个基本的例子：云计算由无数个基本个体进行运算，各个个体之间并无一个整体调节控制，同时没有人了解整个云计算整体，但是其能稳定的实现一个特殊功能。在自然界中，等整体也符合涌现计算。 (zh)
gold:hypernym	Algorithm
prov:wasDerivedFrom	wikipedia-en:Emergent_algorithm?oldid=1099203907&ns=0
page length (characters) of wiki page	1994 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Emergent_algorithm
is Link from a Wikipage to another Wikipage of	List of algorithm general topics Index of education articles Artificial intelligence Emergent algorithms Emergent computation Emergent computing
is Wikipage redirect of	Emergent algorithms Emergent computation Emergent computing
is foaf:primaryTopic of	wikipedia-en:Emergent_algorithm

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software