4066 search results - page 154 / 814 » Almost Complete Sets |
177
click to vote
ISTCS
1993
Springer
15 years 10 months ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
149
click to vote
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
Traditional digital circuit synthesis flows start from an HDL behavioral definition and assume that circuit functions are almost completely defined, making don't-care conditio...
173
click to vote
CARDIS
2006
Springer
15 years 10 months ago
2006
Springer
Ahead-of-Time and Just-in-Time compilation are common ways to improve runtime performances of restrained systems like Java Card by turning critical Java methods into native code. H...
157
click to vote
DAS
2006
Springer
15 years 10 months ago
2006
Springer
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that complete contains the shape. The best-fit bounding...
164
click to vote
DLOG
2008
15 years 8 months ago
2008
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...