4303 search results - page 19 / 861 » Are We There Yet |
AAAI
1994
13 years 8 months ago
1994
We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about fluents, events and temporal const...
IPL
2008
13 years 7 months ago
2008
A relatively longstanding question in algorithmic randomness is Jan Reimann's question whether there is a Turing cone of broken dimension. That is, is there a real A such that...
NECO
2008
13 years 7 months ago
2008
In this paper we show that exponentially deep belief networks [3, 7, 4] can approximate any distribution over binary vectors to arbitrary accuracy, even when the width of each lay...
NECO
2006
13 years 7 months ago
2006
Boltzmann machine is a classic model of neural computation, and a number of methods have been proposed for its estimation. Most methods are plagued by either very slow convergence...
IADIS
2003
13 years 8 months ago
2003
As a consequence of the great number of web modelling languages arisen in the last few years, some criteria to compare them have to be given. Thus, a few authors have made a recol...