Evolutionary Optimization in an Algorithmic Setting
| dc.creator | Burgin, Mark | |
| dc.creator | Eberbach, Eugene | |
| dc.date | 2006-11-16 | |
| dc.date.accessioned | 2026-07-07T07:31:43Z | |
| dc.date.available | 2026-07-07T07:31:43Z | |
| dc.description | Evolutionary processes proved very useful for solving optimization problems. In this work, we build a formalization of the notion of cooperation and competition of multiple systems working toward a common optimization goal of the population using evolutionary computation techniques. It is justified that evolutionary algorithms are more expressive than conventional recursive algorithms. Three subclasses of evolutionary algorithms are proposed here: bounded finite, unbounded finite and infinite types. Some results on completeness, optimality and search decidability for the above classes are presented. A natural extension of Evolutionary Turing Machine model developed in this paper allows one to mathematically represent and study properties of cooperation and competition in a population of optimized species. | |
| dc.identifier | https://arxiv.org/abs/cs/0611077 | |
| dc.identifier | http://arxiv.org/abs/cs/0611077 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/118854 | |
| dc.subject | Neural and Evolutionary Computing | |
| dc.subject | Artificial Intelligence | |
| dc.title | Evolutionary Optimization in an Algorithmic Setting | |
| dc.type | text |