520 search results - page 100 / 104 » New Complexity Results for Classical Planning Benchmarks |
ASPLOS
2012
ACM
12 years 2 months ago
2012
ACM
Despite a burgeoning demand for parallel programs, the tools available to developers working on shared-memory multicore processors have lagged behind. One reason for this is the l...
GECCO
2007
Springer
14 years 26 days ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
FOCS
2007
IEEE
13 years 10 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
ESANN
2007
13 years 8 months ago
2007
Abstract. We approach the themes “computing with chaos” and “reservoir computing” in a unified setting. Different neural architectures are mentioned which display chaotic...
BIOINFORMATICS
2010
13 years 6 months ago
2010
Motivation: As next generation sequencing is rapidly adding new genomes, their correct placement in the taxonomy needs verification. However, the current methods for confirming cl...