2911 search results - page 417 / 583 » A Logic of Graph Constraints |
111
Voted
LACL
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...
108
Voted
STACS
2001
Springer
15 years 5 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
113
click to vote
FPGA
1997
ACM
15 years 5 months ago
1997
ACM
This paper describes an application in high-performance signal processing using reconfigurable computing engines: a 250 MHz cross-correlator for radio astronomy. Experimental resu...
120
Voted
ICCAD
1994
IEEE
15 years 5 months ago
1994
IEEE
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
105
click to vote
DATE
2004
IEEE
15 years 4 months ago
2004
IEEE
System level modeling with executable languages such as C/C++ has been crucial in the development of large electronic systems from general processors to application specific desig...