Sciweavers

1532 search results - page 130 / 307
» The Symbol Grounding Problem
Sort
View
CL
2000
Springer
15 years 10 months ago
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
Tommi A. Junttila, Ilkka Niemelä
EUROGP
2008
Springer
128views Optimization» more  EUROGP 2008»
15 years 8 months ago
Hardware Accelerators for Cartesian Genetic Programming
A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a genetic engine which is reused in all applications. Candidat...
Zdenek Vasícek, Lukás Sekanina
COLING
2010
15 years 1 months ago
Antelogue: Pronoun Resolution for Text and Dialogue
Antelogue is a pronoun resolution prototype designed to be released as off-the-shelf software to be used autonomously or integrated with larger anaphora resolution or other NLP sy...
Eleni Miltsakaki
ICASSP
2011
IEEE
14 years 10 months ago
Integrated Sidelobe Level of sets of Rotated Legendre Sequences
We here address the problem of constructing sets of sequences with low integrated aperiodic auto- and crosscorrelations when the constraint of antipodal symbols is enforced. Our m...
Salvador Javier Haboba, Riccardo Rovatti, Gianluca...
DAC
1999
ACM
16 years 7 months ago
A Novel VLSI Layout Fabric for Deep Sub-Micron Applications
We propose a new VLSI layout methodology which addresses the main problems faced in Deep Sub-Micron (DSM) integrated circuit design. Our layout "fabric" scheme eliminate...
Sunil P. Khatri, Amit Mehrotra, Robert K. Brayton,...