381 search results - page 26 / 77 » Time Complexity of genetic algorithms on exponentially scale... |
ASPDAC
2004
ACM
14 years 1 months ago
2004
ACM
With the exponential reduction in the scaling of feature size, inter-wire coupling capacitance becomes the dominant part of load capacitance. Two problems are introduced by coupli...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper analyzes the scalability of the population size required in XCS to maintain niches that are infrequently activated. Facetwise models have been developed to predict the ...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
PRICAI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...