### Table 2 { Comparison of exact vs. heuristic methods

1997

Cited by 2

### Table 3. Example result of Heuristic Method 1

2005

### Table 7: Other Heuristics Method Approach References

### Table 2: Comparison of Spectral Based Heuristic Method with misII

1997

"... In PAGE 2: ... Depending on the Chow parameter magnitudes, a series of heuris- tic rules are invoked that govern the OBDD decompo- sition/logic realization step. Table2 contains data regarding the synthesis of some common benchmark circuits and a comparison using the misII tool from Berkeley with the \rugged script quot;. Table 2: Comparison of Spectral Based Heuristic Method with misII... ..."

Cited by 1

### Table 2: Comparison of Spectral Based Heuristic Method with misII

1997

"... In PAGE 2: ... Depending on the Chow parameter magnitudes, a series of heuris- tic rules are invoked that govern the OBDD decompo- sition/logic realization step. Table2 contains data regarding the synthesis of some common benchmark circuits and a comparison using the misII tool from Berkeley with the \rugged script quot;. Table 2: Comparison of Spectral Based Heuristic Method with misII... ..."

Cited by 1

### Table VI: Comparison of Heuristic Methods with ECS and Slack Scheduling

2000

Cited by 2

### Table VI: Comparison of Heuristic Methods with ECS and Slack Scheduling

2000

Cited by 2

### Table 3: Results of the Probability Based Heuristic Method for DD Reordering

1997

"... In PAGE 2: ... We utilize probability measures to arrive at the initial ordering. By sorting the variables in ascending order based on the values of }fCxi(f)g where the consensus function, Cxi(f) = fxi fxi, is based on the Shannon co-factors of the function, f, has yielded the following experimental results given in Table3 . These compu- tations were performed using negative edge-attributed SBDDs on a 100 MHz SPARCstation 20 with 160 MB of RAM.... ..."

Cited by 1

### Table 3: Results of the Probability Based Heuristic Method for DD Reordering

1997

"... In PAGE 2: ... We utilize probability measures to arrive at the initial ordering. By sorting the variables in ascending order based on the values of }fCxi(f)g where the consensus function, Cxi(f) = fxi fxi, is based on the Shannon co-factors of the function, f, has yielded the following experimental results given in Table3 . These compu- tations were performed using negative edge-attributed SBDDs on a 100 MHz SPARCstation 20 with 160 MB of RAM.... ..."

Cited by 1

### TABLE III PARTIAL BIST INSERTION AND FAULT COVERAGE BY HEURISTIC METHOD.

1999

Cited by 1