Sciweavers

467 search results - page 64 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
GECCO
2009
Springer
15 years 6 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
15 years 3 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
CORR
2002
Springer
166views Education» more  CORR 2002»
14 years 11 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 4 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
SIAMAM
2000
128views more  SIAMAM 2000»
14 years 11 months ago
Advection-Diffusion Equations for Internal State-Mediated Random Walks
Abstract. In many biological examples of biased random walks, movement statistics are determined by state dynamics that are internal to the organism or cell and that mediate respon...
Daniel Grünbaum