4099 search results - page 455 / 820 » A Framework for Interactive Proof |
238
click to vote
GOSLER
1995
15 years 10 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
210
click to vote
ELP
1991
15 years 10 months ago
1991
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
134
click to vote
AAAI
2008
15 years 9 months ago
2008
Hierarchical state decompositions address the curse-ofdimensionality in Q-learning methods for reinforcement learning (RL) but can suffer from suboptimality. In addressing this, w...
190
click to vote
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
159
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...