1054 search results - page 21 / 211 » A Formalization of the Turing Test |
JAR
2010
15 years 11 days ago
2010
FMICS
2009
Springer
15 years 8 months ago
2009
Springer
123
click to vote
JMLR
2012
13 years 4 months ago
2012
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
128
click to vote
MST
2011
14 years 4 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
145
click to vote
IPL
2008
15 years 1 months ago
2008
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...