Sciweavers

590 search results - page 70 / 118
» From Relational Specifications to Logic Programs
Sort
View
FPL
2009
Springer
99views Hardware» more  FPL 2009»
14 years 1 months ago
Exploiting fast carry-chains of FPGAs for designing compressor trees
Fast carry chains featuring dedicated adder circuitry is a distinctive feature of modern FPGAs. The carry chains bypass the general routing network and are embedded in the logic b...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne
AAAI
1994
13 years 10 months ago
Representing Multiple Theories
Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...
P. Pandurang Nayak
EELC
2006
154views Languages» more  EELC 2006»
14 years 15 days ago
Unify and Merge in Fluid Construction Grammar
Research into the evolution of grammar requires that we employ formalisms and processing mechanisms that are powerful enough to handle features found in human natural languages. Bu...
Luc Steels, Joachim De Beule
POPL
2010
ACM
14 years 6 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
JAIR
2008
157views more  JAIR 2008»
13 years 8 months ago
Qualitative System Identification from Imperfect Data
Experience in the physical sciences suggests that the only realistic means of understanding complex systems is through the use of mathematical models. Typically, this has come to ...
George Macleod Coghill, Ashwin Srinivasan, Ross D....