Results 1 - 10 of 26,785

TABLE II QUALITY OF DETERMINISTIC PATHS.

in Variation-Aware Performance Verification Using At-Speed Structural Test And Statistical Timing
by Vikram Iyengar, Jinjun Xiong, Subbayyan Venkatesan, Vladimir Zolotov, David Lackey, Peter Habitz, Chandu Visweswariah

Table 3 Application resource bottlenecks Type Bottleneck Graphics, encryption CPU, memory

in 1. Introduction Applying Queuing Theory to Optimizing the Performance of Enterprise Software Applications
by Henry H. Liu, Ph. D

Table 6.2: The maximum throughput at identified bottlenecks in the data path.

in It is I -- An Authentication System for a Reconfigurable Radio
by Arya Abraham 2002
Cited by 3

TABLE V ALGORITHM FOR COMPUTING CONSTRAINED BOTTLENECK MULTICAST TREES

in Algorithms for precomputing constrained widest paths and multicast trees
by Stavroula Siachalou, Leonidas Georgiadis
Cited by 1

TABLE V Algorithm For Computing Constrained Bottleneck Multicast Trees

in Algorithms for Precomputing Constrained Widest Paths and Multicast Trees
by Leonidas Georgiadis, et al.

Table 3. Descriptions of the game trees used in the experiments.

in Searching Game Trees in Parallel *
by Igor Steinberg, Marvin Solomon
"... In PAGE 16: ...as not performed below ply five. Successors of e-nodes were also not sorted. For the random trees, each leaf was assigned an independent pseudo-random value drawn from a uniform distribution. Table3 out- lines the differences among the trees. Figures 10 and 11 plot efficiency for ER on Othello and random game trees, respectively.... ..."

Table 1. Results for Deterministic Testing

in Synthesis of Zero-Aliasing Elementary-Tree Space Compactors
by Bahram Pouya, Nur A. Touba 1998
"... In PAGE 6: ... Experimental Results The synthesis procedures described here were used to design zero-aliasing elementary-tree space compactors for the ISCAS 85 benchmark circuits [Brglez 85]. Table1 shows the results for deterministic testing. The number of primary inputs, primary outputs, and the maximum number of logic levels for each of the benchmark circuits are shown followed by the results for adding a space compactor to the circuit.... ..."
Cited by 9

Table 1. Results for Deterministic Testing

in Synthesis of Zero-Aliasing Elementary-Tree Space Compactors
by unknown authors
"... In PAGE 6: ... Experimental Results The synthesis procedures described here were used to design zero-aliasing elementary-tree space compactors for the ISCAS 85 benchmark circuits [Brglez 85]. Table1 shows the results for deterministic testing. The number of primary inputs, primary outputs, and the maximum number of logic levels for each of the benchmark circuits are shown followed by the results for adding a space compactor to the circuit.... ..."

Table 1. Design results for Bottleneck Network

in Considering End-to-End QoS in IP Network Design
by Emilio C. G. Wille, Michele Garetto, Marco Mellia, Emilio Leonardi, Marco Ajmone Marsan
"... In PAGE 4: ... We assume oneway TCP New Reno connections with not congested backward path. Table1 reports the capacity and Table 1. Design results for Bottleneck Network... ..."

Table 1. Game1 { Number of Trials Per Learned Policies under Deterministic Setup.

in An Experimental Study of Different Approaches to Reinforcement Learning in Common Interest Stochastic Games câ—‹Springer-Verlag
by Avi Bab, Ronen Brafman
"... In PAGE 7: ... Algorithms were executed for 107 rounds on both settings. For the deterministic setup Table1 classi es the number of trials (of 100 in S(A) S(B) T(B) T(A) Fig.... ..."
Results 1 - 10 of 26,785