2467 search results - page 142 / 494 » Finite State Machines |
175
click to vote
CPC
2004
15 years 6 months ago
2004
Using representation theory, we obtain a necessary and sufficient condition for a discrete
168
click to vote
ALT
1998
Springer
15 years 10 months ago
1998
Springer
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
179
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. For large state-space Markovian Decision Problems MonteCarlo planning is one of the few viable approaches to find near-optimal solutions. In this paper we introduce a new...
143
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
127
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...