2479 search results - page 253 / 496 » A Computational Theory of Working Memory |
179
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
167
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
190
click to vote
MFCS
2007
Springer
16 years 24 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
228
click to vote
ACOM
2006
Springer
16 years 19 days ago
2006
Springer
In this research, we re-arrange FIPA’s ACL performatives to form a subsumption lattice (ontology) and apply a theory of social commitments to achieve a simplified and observable...
151
click to vote
WWW
2005
ACM
16 years 6 days ago
2005
ACM
: We believe that much novel insight into the worldwide web can be obtained from taking into account the important fact that it is created, used, and run by selfish optimizing agen...