A.I. Research in Hybrid Self-Adaptive Algorithms in Dynamic Environments ( Beta)
Skip Navigation Links
Cellular Automata
Skip Navigation Links

Coming Soon.  Will discuss Cellular Automata (CA) in general, and more specifically how they are employed within self-adaptive hybrid algorithms.

CA are integral to the concept of self-adaptive hybrid algorithms.  They permit coalescence and division of converging, diverging, and limit-approaching parameter values.

Previous research into self-adaptive algorithms used a static weight-based governor.  This current research employs CA to govern parameter adaptation.  This research will attempt to prove (or - hopefully not - disprove) the efficacy of CA governance as an adaptive hypothesis.


Copyright Martin Kelly 2014
You are not currently logged in
Click here for the Login Page