See this document in CiteSeerX!

Evolutionary Computation as a Multi-Agent Search: a $-Calculus Perspective for its Completeness and Optimality (2001)  (Make Corrections)  (3 citations)
Eugene Eberbach



  Home/Search   Context   Related

 
View or download:
umassd.edu/~eeberbach/pape...cec2001.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  umassd.edu/~eeberbach...paperlist (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Evolutionary computation in its essense represents a multi-agent competitive probabilistic search. It is useful for solutions of polynomial and hard optimization problems. The solutions found by evolutionary algorithms are not guaranteed to be optimal and evolutionary search is computationally very expensive. Using a generic $-calculus approach to AI, based on process algebras and anytime algorithms, we show that evolutionary search can be considered a special case of $-calculus k\Omega... (Update)

Cited by:   More
BioSystems 82 (2005) 1--19 - Toward Theory Of   (Correct)
Is Entscheidungsproblem Solvable? - Beyond Undecidability Of   (Correct)
On Expressiveness of Evolutionary Computation: Is EC Algorithmic? - Eberbach (2002)   (Correct)

Similar documents (at the sentence level):
41.3%:   $-Calculus Bounded Rationality = Process Algebra + Anytime.. - Eberbach   (Correct)
13.6%:   Fundamenta Informaticae 68 (2005) 47--102 47 IOS Press - Calculus Of Bounded   (Correct)
7.4%:   On Designing CO$T: A New Approach and - Programming Environment For   (Correct)

Active bibliography (related documents):   More   All
0.9:   Expressing Evolutionary Computation, Genetic Programming, Artif.. - Eberbach (2000)   (Correct)
0.4:   Flexible Optimization And Evolution Of Underwater.. - Eberbach, Brooks, Phoha (1999)   (Correct)
0.4:   Expressiveness of $-Calculus: What Matters? - Eberbach (2000)   (Correct)

Similar documents based on text:   More   All
0.6:   Teams In Software Engineering Education - Sims-Knight, Upchurch, Powers.. (2002)   (Correct)
0.5:   Course-Based Assessment: Engaging Faculty In.. - Sims-Knight, Fowler, .. (2000)   (Correct)
0.5:   Integrating Engineering Courses With Calculus And.. - Raymond Laoulache..   (Correct)

Related documents from co-citation:   More   All
3:   Calculus Bounded Rationality = Process Algebra + Anytime Algorithms (context) - Eberbach - 2001
3:   Beyond Turing Machines (context) - Eberbach, Wegner - 2001
2:   Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979

BibTeX entry:   (Update)

Eberbach E., Evolutionary Computation as a MultiAgent Search: A $-Calculus Perspective for its Completeness and Optimality, Proc. 2001. http://citeseer.ist.psu.edu/eberbach01evolutionary.html   More

@misc{ eberbach01evolutionary,
  author = "E. Eberbach",
  title = "Evolutionary Computation as a MultiAgent Search: A $-Calculus Perspective
    for its Completeness and Optimality",
  text = "Eberbach E., Evolutionary Computation as a MultiAgent Search: A $-Calculus
    Perspective for its Completeness and Optimality, Proc. 2001.",
  year = "2001",
  url = "citeseer.ist.psu.edu/eberbach01evolutionary.html" }
Citations (may not include all citations):
854   Information and Computation (context) - Milner, Parrow et al. - 1992  DBLP
782   Artificial Intelligence: A Modern Approach (context) - Russell, Norvig - 1995  DBLP
548   Genetic Algorithms + Data Structures = Evolution Programs (context) - Michalewicz - 1996
402   An Analysis of Time-Dependent Planning (context) - Dean, Boddy - 1988  DBLP
180   Algorithms for Scheduling Imprecise Computations (context) - Lin, Shih et al. - 1991  ACM   DBLP
151   Problem Solving Methods in Artificial Intelligence (context) - Nilsson - 1971
137   Do the Right Thing: Studies in Limited Rationality (context) - Russell, Wefald - 1991
94   Why Interaction is More Powerful Than Algorithms - Wegner - 1997
93   Reasoning about Beliefs and Actions under Computational Reso.. - Horvitz
81   Operational Rationality through Compilation of Anytime Algor.. - Zilberstein - 1993  ACM   DBLP
76   The Polyadic -Calculus: A Tutorial - Milner - 1992
45   Interactive Foundations of Computing - Wegner - 1997  ACM   DBLP
13   Coinductive Models of Finite Computing Agents - Wegner, Goldin - 1999  DBLP
8   Calculus: What Matters (context) - Eberbach, Expressiveness
7   Flexible Optimization and Evolution of Underwater Autonomous.. - Eberbach, Brooks et al. - 1999  ACM   DBLP
7   A Generic Tool for Distributed AI with Matching as Message P.. (context) - Eberbach - 1997  ACM   DBLP
5   SEMAL: A Cost Language Based on the Calculus of Self-modif i.. (context) - Eberbach - 1994
4   Enhancing Genetic Programming by $- calculus (context) - Eberbach
4   Introduction to Evolutionary Computation (context) - Fogel
2   Calculus: Flexible Optimization as Search under Bounded Reso.. (context) - Eberbach - 2000
1   Calculus Bounded Rationality = Process Algebra + Anytime Alg.. (context) - Eberbach - 2001
1   Autonomous Agents and DNA-Based Computing in $-Calculus - Re.. (context) - Eberbach

Documents on the same site (http://www.cis.umassd.edu/~eeberbach/paperlist.html):   More
Flexible Optimization And Evolution Of Underwater.. - Eberbach, Brooks, Phoha (1999)   (Correct)
Expressing Evolutionary Computation, Genetic Programming, Artif.. - Eberbach (2000)   (Correct)
$-Calculus Bounded Rationality = Process Algebra + Anytime.. - Eberbach   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC