5606 search results - page 810 / 1122 » Randomization Techniques for Graphs. |
192
Voted
PLILP
1997
Springer
15 years 11 months ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
213
Voted
ICCD
1996
IEEE
15 years 11 months ago
1996
IEEE
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
208
click to vote
SIGGRAPH
1994
ACM
15 years 10 months ago
1994
ACM
This paper describes a novel system for creating virtual creatures that move and behave in simulated three-dimensional physical worlds. The morphologies of creatures and the neura...
165
click to vote
ATVA
2009
Springer
15 years 10 months ago
2009
Springer
We present a framework for certifying hardware designs generated through behavioral synthesis, by using formal verification to certify the associated synthesis transformations. We ...
154
click to vote
AAECC
2006
Springer
15 years 10 months ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...