Sciweavers

9787 search results - page 1814 / 1958
» A Utile Function Optimizer
Sort
View
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
13 years 8 months ago
Strings with Maximally Many Distinct Subsequences and Substrings
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
Abraham Flaxman, Aram Wettroth Harrow, Gregory B. ...
CORR
2004
Springer
106views Education» more  CORR 2004»
13 years 8 months ago
Presynaptic modulation as fast synaptic switching: state-dependent modulation of task performance
Neuromodulatory receptors in presynaptic position have the ability to suppress synaptic transmission for seconds to minutes when fully engaged. This effectively alters the synaptic...
Gabriele Scheler, Johann Schumann
ECCC
2000
158views more  ECCC 2000»
13 years 8 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
CSCW
2002
ACM
13 years 8 months ago
Instant messaging in teen life
Instant Messaging (IM) is being widely adopted by teenagers. In a study of 16 teenage IM users, we explore IM as an emerging feature of teen life, focusing our questions on its su...
Rebecca E. Grinter, Leysia Palen
ML
2000
ACM
244views Machine Learning» more  ML 2000»
13 years 8 months ago
Learnable Evolution Model: Evolutionary Processes Guided by Machine Learning
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
Ryszard S. Michalski
« Prev « First page 1814 / 1958 Last » Next »