14774 search results - page 132 / 2955 » Computational complexity and evolutionary computation |
136
click to vote
ACMSE
2006
ACM
15 years 8 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
151
click to vote
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
117
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most mu...
123
click to vote
CACM
2006
15 years 4 months ago
2006
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...
130
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...