5606 search results - page 812 / 1122 » Randomization Techniques for Graphs. |
156
click to vote
ISLPED
1995
ACM
15 years 10 months ago
1995
ACM
Abstract: We describe a technique to estimate the energy consumed by speed-independent asynchronous (clockless) control circuits. Because speed-independent circuits are hazard-free...
186
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
191
click to vote
DAC
2005
ACM
15 years 8 months ago
2005
ACM
Layout parasitics have great impact on analog circuit performance. This paper presents an algorithm for explicit parasitic control during layout retargeting of analog integrated c...
201
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We propose a framework that learns functional objectes from spatio-temporal data sets such as those abstracted from video. The data is represented as one activity graph t...
171
click to vote
AAIM
2008
Springer
15 years 8 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...