Sciweavers

1701 search results - page 168 / 341
» Computer Science and State Machines
Sort
View
ML
2002
ACM
121views Machine Learning» more  ML 2002»
14 years 10 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
TSD
2010
Springer
14 years 8 months ago
Correlation Features and a Linear Transform Specific Reproducing Kernel
Abstract. In this paper we introduce two ideas for phoneme classification: First, we derive the necessary steps to integrate linear transform into the computation of reproducing ke...
Andreas Beschorner, Dietrich Klakow
SIGCSE
2010
ACM
169views Education» more  SIGCSE 2010»
15 years 5 months ago
Interfaces first (and foremost) with Java
ion is a critical concept that underlies many topics in computing science. For example, in software engineering, the distinction between a component’s behavior and its implement...
Paolo A. G. Sivilotti, Matthew Lang
FOCS
2006
IEEE
15 years 4 months ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
TARK
1992
Springer
15 years 2 months ago
Topological Reasoning and The Logic of Knowledge
We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logi...
Lawrence S. Moss, Rohit Parikh