14774 search results - page 414 / 2955 » Computational complexity and evolutionary computation |
173
click to vote
ENTCS
2007
15 years 6 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
198
click to vote
IJCINI
2007
15 years 6 months ago
2007
: The theme of this issue of IJCINI is on cognitive mechanisms of autonomic computing and laws of human cooperative work organization. This editorial addresses key notions of this ...
141
click to vote
MOC
1998
15 years 6 months ago
1998
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
218
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
175
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...