460 search results - page 24 / 92 » Evolving Quantum Circuits Using Genetic Algorithm |
IWANN
1995
Springer
15 years 3 months ago
1995
Springer
This paper presents a comparative analysis of neural networks, simulated annealing, and genetic algorithms in the determination of input patterns for testing analog circuits. The ...
180
click to vote
ICCCI
2011
Springer
13 years 11 months ago
2011
Springer
Multiagent reinforcement learning problems are especially difficult because of their dynamism and the size of joint state space. In this paper a new benchmark problem is proposed, ...
STOC
1997
ACM
15 years 3 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
119
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the for...