143 search results - page 4 / 29 » Evolving blackbox quantum algorithms using genetic programmi... |
127
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
159
Voted
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Self-Modifying Cartesian Genetic Programming (SMCGP) is a form of genetic programming that integrates developmental (self-modifying) features as a genotype-phenotype mapping. This...
147
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
157
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
142
click to vote
QCQC
1998
Springer
15 years 9 months ago
1998
Springer
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...