2911 search results - page 288 / 583 » A Logic of Graph Constraints |
148
click to vote
IJCINI
2007
15 years 6 months ago
2007
Language is primarily a physical, and more particularly a biological phenomenon. To say that it is primarily so is to say that that is how, in the first instance, it presents itse...
169
click to vote
DAC
2010
ACM
15 years 7 months ago
2010
ACM
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
155
click to vote
TCAD
1998
15 years 6 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
169
click to vote
TODAES
2002
15 years 6 months ago
2002
ct Cross-coupled noise analysis has become a critical concern in today's VLSI designs. Typically, noise analysis makes an assumption that all aggressing nets can simultaneousl...
152
Voted
CSCLP
2005
Springer
16 years 6 days ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...