Sciweavers

894 search results - page 176 / 179
» Optimizations for LTL Synthesis
Sort
View
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
15 years 4 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 4 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
15 years 4 months ago
Unwitting distributed genetic programming via asynchronous JavaScript and XML
The success of a genetic programming system in solving a problem is often a function of the available computational resources. For many problems, the larger the population size an...
Jon Klein, Lee Spector
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
15 years 4 months ago
Coevolution of intelligent agents using cartesian genetic programming
A coevolutionary competitive learning environment for two antagonistic agents is presented. The agents are controlled by a new kind of computational network based on a compartment...
Gul Muhammad Khan, Julian Francis Miller, David M....
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
15 years 4 months ago
A developmental model of neural computation using cartesian genetic programming
The brain has long been seen as a powerful analogy from which novel computational techniques could be devised. However, most artificial neural network approaches have ignored the...
Gul Muhammad Khan, Julian F. Miller, David M. Hall...