Evolutionary Optimization in an Algorithmic Setting

Details Evolutionary Optimization in an Algorithmic Setting Evolutionary Optimization in an Algorithmic Setting

2006-11-16

arxiv.org/abs/cs/0611077v1

Computer Science

Neural and Evolutionary Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Evolutionary Optimization in an Algorithmic Setting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Evolutionary Optimization in an Algorithmic Setting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Evolutionary Optimization in an Algorithmic Setting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-622949