244 search results - page 34 / 49 » Turing machines and bimachines |
COLT
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
GECCO
2003
Springer
14 years 19 days ago
2003
Springer
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
KR
2010
Springer
14 years 6 days ago
2010
Springer
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
AI
1998
Springer
13 years 7 months ago
1998
Springer
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
JUCS
2002
13 years 7 months ago
2002
: A purely communicative variant of P systems was considered recently, based on the trans-membrane transport of couples of chemicals. When using both symport rules (the chemicals p...