The Firefly Machine: Online Evolware - Evolutionary Computation, 1997., IEEE International Conference on
نویسندگان
چکیده
We present the firefly machine, an evolving hardware system, demonstrating that “evolving ware,” evolware, can be attained. The system is based on the cellular programming approach, in which parallel cellular machines evolve to solve computational tasks. The firefly system operates with no reference to an external device, such as a computer that carries out genetic operators, thereby exhibiting online autonomous evolution.
منابع مشابه
The Firefly Machine: Online Evolware
We present the firefly machine, an evolving hardware system, demonstrating that “evolving ware,” evolware, can be attained. The system is based on the cellular programming approach, in which parallel cellular machines evolve to solve computational tasks. The firefly system operates with no reference to an external device, such as a computer that carries out genetic operators, thereby exhibiting...
متن کاملSolving Five Instances of the Artificial Ant Problem with Ant Colony Optimization
· Chivilikhin D., Ulyantsev V. Learning Finite-State Machines with Ant Colony Optimization // Lecture Notes in Computer Science, 2012, Volume 7461/2012, pp. 68275 · Chivilikhin D., Ulyantsev V., Tsarev F. Test-Based Extended Finite-State Machines Induction with Evolutionary Algorithms and Ant Colony Optimization / Proceedings of the 2012 GECCO Conference Companion on Genetic and Evolutionary Co...
متن کاملEditorial: Welcome To The IEEE Neural Networks Society
I WANT towelcomeyou toournewly formedsociety.On February 17, 2002, the IEEE Neural Networks Council (NNC), publisher of the IEEE TRANSACTIONS ON NEURAL NETWORKS (TNN), the IEEE TRANSACTIONS ON FUZZY SYSTEMS (TFS), and the IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (TEC), became the IEEE Neural Networks Society (NNS). This accomplishment was made possible by the relentless efforts of our ExCo...
متن کاملReversible Space Equals Deterministic Space
This paper describes the simulation of an S(n) spacebounded deterministic Turing machine by a reversible Turing machine operating in space S(n). It thus answers a question posed by Bennett in 1989 and refutes the conjecture, made by Li and Vitanyi in 1996, that any reversible simulation of an irreversible computation must obey Bennett’s reversible pebble game rules.
متن کاملA Novel Deduplication Technique Using an Evolutionary Approach
The process which identifies the records that refers to the same entity in data storage is known as record deduplication. UDD can effectively identify duplicates of different web databases. Initially from the non duplicate record set, the two different classifiers, a Weighted WCSS is used for deduplication. The approach joins different pieces of attribute with similarity function extracted from...
متن کامل