1054 search results - page 46 / 211 » A Formalization of the Turing Test |
160
click to vote
AISB
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
198
click to vote
OOPSLA
2007
Springer
16 years 25 days ago
2007
Springer
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
166
click to vote
NLE
2010
15 years 5 months ago
2010
Pyramid annotation makes it possible to evaluate quantitatively and qualitatively the content of machine-generated (or human) summaries. Evaluation methods must prove themselves a...
291
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
186
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
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 poly...