197 search results - page 2 / 40 » Circuits, Pebbling and Expressibility |
LICS
2000
IEEE
13 years 10 months ago
2000
IEEE
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
HICSS
2003
IEEE
13 years 11 months ago
2003
IEEE
Abstract— This paper presents a framework for verifying compilation tools for parametrised hardware libraries with placement information. Such libraries are captured in Pebble, a...
STACS
2007
Springer
14 years 11 days ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
ALT
2011
Springer
12 years 6 months ago
2011
Springer
Deep architectures are families of functions corresponding to deep circuits. Deep Learning algorithms are based on parametrizing such circuits and tuning their parameters so as to ...
EVOW
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Software configurable analogue arrays offer an intriguing platform for automated design by evolutionary algorithms. Like previous evolvable hardware experiments, these pl...