Results 1 - 10 of 120,326

Table 2: Some combinational circuits with large number of

in A Graph-Based Synthesis Algorithm for AND/XOR Networks
by Yibin Ye, Kaushik Roy
"... In PAGE 5: ... As long as the initial decision diagram are successfully created, the XORDD-based method can always generate results. Table2 listed several circuits for which a b b d 1 1 1 c c c c 1 1 1 c c c c c 1 a b b d 1 0 1 0 0 01 1 0 1 1 0 010 c d 1 11 a b bc 1 1 0 00 1 0 01 01 b c a b c d 1 1 1 b d 1 10 0 0 11 a b b c c d c 1 1 1 0 1 1 1 0 0 0 1 1 0 1 1 0 c 1 1 a b b c d 1 0 0 0 1 1 00 1 0 01 010 1 0 1 0101 01 1 0 0 (b) (c) (e) (f) (a) (d) =aba c cd Figure 7: An example showing how the algorithm is per- formed on a function|-from initial BDD to the #0Cnal com- pact XORDD, which gives a minimized ESOP form ESPRESSO did not produce any result in 30 minutes on a SUN SPARCworkstation. The last column node in Table 2 represents the number of nodes in an XORDD.... ..."

Table 5: Circuits with large numbers of inputs (averages)

in Definitions of the Numbers of Detections of Target Faults and their Effectiveness in Guiding Test Generation for High Defect Coverage
by Irith Pomeranz, Sudhakar M. Reddy 2001
Cited by 2

Table 2.1: Reference for large numbers.

in Course: TTM4705
by Svein J. Knapskog 2007

Table 1. The large number of possible configurations makes

in unknown title
by unknown authors
"... In PAGE 5: ... Table1 : Categories of individual and team behav- iors. Team autonomy means that the robots can execute the Team Move behavior.... ..."

Table 2: Large number simulation summary.

in Statistical Estimation of Average Power Dissipation in Sequential Circuits
by Li-Pen Yuan, Chin-Chi Teng, Sung-Mo Kang
"... In PAGE 5: ... Hence simulation efficiency is greatly improved by not as- signing a pessimistic warm-up period apriori[9]. To understand the average performance of the proposed technique, we conducted 1,000 simulation runs for every circuit and summarized the results in Table2 . In this table, I:I: min , I:I: max and I:I: avg are the minimum, maximum and average independence interval, respectively.... In PAGE 6: ... Thus, for a circuit we would not obtain a fixed independence interval. Nevertheless, Table2 shows that the estimation results indeed meet the accuracy speci- fication with very low average deviation. The accuracy and robustness of the technique are therefore demonstrated.... ..."

Tables 1 and 2. First is the large number of depen-

in Abstract Static and Dynamic Evaluation of Data Dependence Analysis*
by Paul M. Petersen, David A. Padua

Table 4: Resource requirements for monitoring large number of flows simultaneously.

in A Combined Hardware-Software Architecture for Network Flow Analysis
by S. Yusuf, W. Luk, M. Sloman, N. Dulay, E. C. Lupu, G. Brown 2005
"... In PAGE 6: ... This is adequate for most networks nowa- days, and sufficient for 10 Gbps traffic rates as shown in Table 1. Table4 shows the amount of resources that would be required for large active flows to be processed at the estimated performance rate. 7 Run-time Reconfiguration The modules described in Section 3 and Figure 3 can be used to provide the flexibility lacking in a full hardware implementation, enabling the system to automatically recognise time-critical occurrences of suspicious packet activity, such as host drop- ping/losing excessive number of packets, or receipt by a host of unusually large amounts of packets.... ..."
Cited by 1

Table I indicates that there are a large number of nontrivial classes in both corpora.

in Using suffix arrays to compute term frequency and document frequency for all substrings in a corpus
by Mikio Yamamoto, Kenneth W. Churcht 2001
Cited by 25

Tables available in Wyszecki and Stiles give CIE chromaticityvalues for a large number

in Visualization of Multivariate Data Using Preattentive Processing
by Christopher G. Healey 1992
Cited by 4

Table 1: Results for STGs with a large number of states

in Methodology and Tools for State Encoding in Asynchronous Circuit Synthesis
by Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Alex
"... In PAGE 4: ... Two fac- tors are essential for this capability: (1) the symbolic representation and manipulation of the state graph by means of Ordered Binary Decision Diagrams (2) the exploration of blocks of states at the level of regions rather than states. Table1 presents the CPU times (in seconds on a SPARCSTATION 20) required to satisfy CSC for some examples with a vast state space, which cannot be solved in a reasonable amount of memory or time by SIS or ASSASSIN. Table 2reports the results obtainedwith petrify incomparison with the ones obtained by ASSASSIN ([5]).... ..."
Results 1 - 10 of 120,326