Sciweavers

1532 search results - page 96 / 307
» The Symbol Grounding Problem
Sort
View
128
Voted
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 9 months ago
A statistical learning theory approach of bloat
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, ...
CAV
2004
Springer
123views Hardware» more  CAV 2004»
15 years 9 months ago
SAL 2
SAL 2 augments the specification language and explicit-state model checker of SAL 1 with high-performance symbolic and bounded model checkers, and with novel infinite bounded and...
Leonardo Mendonça de Moura, Sam Owre, Haral...
ECCV
2010
Springer
15 years 6 months ago
Descriptor Learning for Efficient Retrieval
Many visual search and matching systems represent images using sparse sets of "visual words": descriptors that have been quantized by assignment to the best-matching symb...
CORR
2010
Springer
67views Education» more  CORR 2010»
15 years 4 months ago
Transfer Entropy on Rank Vectors
A number of measures have been proposed for the direction of the coupling between two time series, and transfer entropy (TE) has been found in recent studies to perform consistentl...
Dimitris Kugiumtzis
ENTCS
2008
89views more  ENTCS 2008»
15 years 4 months ago
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in so...
Sylvain Conchon, Evelyne Contejean, Johannes Kanig...