Improving Evolutionary Algorithms with Scouting: High---Dimensional Problems
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Design of a modular assembly of four-footed robots with multiple functions
Robotics and Computer-Integrated Manufacturing
Improving evolutionary algorithms with scouting
EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
Characterising enzymes for information processing: towards an artificial experimenter
UC'10 Proceedings of the 9th international conference on Unconventional computation
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
| Hi-index | 0.00 |
Abstract: Nature's gadgets are implemented without being planned and therefore can utilize context-sensitive components. Thus functionality that would require extensive networks of context-free components can be elicited from a minimum of material. Proteins can serve as context-sensitive components for pattern processing applications. We here describe an evolutionary search strategy currently under investigation for its potential use in conjunction with computer controlled fluidics to evaluate the computational capabilities of proteins. Our algorithm employs evolutionary search not to seek an optimum, but to seek surprises. It directs experiments and incrementally constructs an empirical model from their outcome. Reward is given for discovering conditions that exhibit a discrepancy between the prediction of the current model and the experimental result. As unexpected observations are incorporated into the model, the reward associated with them vanishes. Results obtained so far indicate that evolutionary search is a useful paradigm for characterizing the phenomenology of context-sensitive components.