14774 search results - page 239 / 2955 » Computational complexity and evolutionary computation |
127
click to vote
HUC
1999
Springer
15 years 9 months ago
1999
Springer
In developing electronic gadgets, meters and oscilloscopes are used to probe into their workings, so that engineers can understand how they are behaving and how they can be improve...
131
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
155
click to vote
CASC
2006
Springer
15 years 8 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
157
click to vote
ANTS
2008
Springer
15 years 7 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
103
click to vote
ERSA
2007
15 years 6 months ago
2007
An autonomous computing system is a system that functions with a large degree of independence, and assumes a large amount of responsibility for its own resources and operation. As...