Sciweavers

424 search results - page 79 / 85
» Improving Evolutionary Algorithms with Scouting
Sort
View
GECCO
2004
Springer
14 years 11 days ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby
DAC
1999
ACM
13 years 11 months ago
Reducing Cross-Coupling Among Interconnect Wires in Deep-Submicron Datapath Design
As the CMOS technology enters the deep submicron design era, the lateral inter-wire coupling capacitance becomes the dominant part of load capacitance and makes RC delay on the bu...
Joon-Seo Yim, Chong-Min Kyung
GECCO
1999
Springer
133views Optimization» more  GECCO 1999»
13 years 11 months ago
Evolution of Goal-Directed Behavior from Limited Information in a Complex Environment
In this paper, we apply an evolutionary algorithm to learning behavior on a novel, interesting task to explore the general issue of learning e ective behaviors in a complex enviro...
Matthew R. Glickman, Katia P. Sycara
AHS
2006
IEEE
95views Hardware» more  AHS 2006»
13 years 10 months ago
A Modular Framework for the Evolution of Circuits on Configurable Transistor Array Architectures
This paper gives an overview over the progress that has been made by the Heidelberg FPTA group within the field of analog evolvable hardware. Achievements are the design of a CMOS...
Martin Trefzer, Jörg Langeheine, Karlheinz Me...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 10 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....