1532 search results - page 116 / 307 » The Symbol Grounding Problem |
133
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
143
click to vote
CADE
2009
Springer
16 years 5 months ago
2009
Springer
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
135
click to vote
ICTAI
2009
IEEE
15 years 11 months ago
2009
IEEE
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
118
click to vote
CSL
2004
Springer
15 years 9 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
133
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We discuss the problem of model selection in Genetic Programming using the framework provided by Statistical Learning Theory, i.e. Vapnik-Chervonenkis theory (VC). We pre...