Results 1 - 10 of 21,859

TABLE III COMPARISON OF NUMBER OF BDD NODES FOR GLOBAL AND LOCAL CONSTRUCTION

in BDD-based Logic Optimization System
by Congguang Yang, Maciej Ciesielski 2000
Cited by 34

Table 1. Cliques found by construct and local

in On Maximum Clique Problems In Very Large Graphs
by J. Abello, P. M. Pardalos, M. G. C. Resende 1999
"... In PAGE 8: ... Because of the independent nature of the GRASP iterations and since our computer is configured with 20 processors, we created 10 threads, each independently running GRASP starting from a different random number generator seed. Table1 summarizes the first part of the experimental results. It shows, for each clique size found, the number of GRASP iterations that constructed or improved such solution, and from sizes 5 to 15, the number of distinct cliques that were found by the GRASP iterations.... ..."
Cited by 36

Table 1. Cliques found by construct and local

in AN OPTIMIZER IN THE TELECOMMUNICATIONS INDUSTRY
by Mauricio G. C. Resende
"... In PAGE 13: ... Because of the independent nature of the GRASP iterations and since our computer was configured with 20 processors, we created 10 threads, each independently running GRASP starting from a different random number generator seed. Table1 summarizes the first part of the experimental results. It shows, for each clique size found, the number of GRASP iterations that constructed or improved... ..."

Table 5.1: Computation time for local tree construction.

in PHANTOM : Parallelization of Hierarchical Applications usiNg Treecodes On Multiprocessors
by Sanjay Goil 1996

TABLE 2 Timings and performance of columnwlse local matrix construction, for a 2 x 4 grrd, on 8 processors.

in USE OF LINEAR ALGEBRA KERNELS TO BUILD AN EFFICIENT FINITE ELEMENT SOLVER
by H. C. Elman, D. K-y Lee, Howard C. Elman, Dennis, K. -y. Lee 1992

TABLE 3 Timings and performance of blockwise local matrix construction, for a 2 x 4 grid, on 8 proces- sors.

in USE OF LINEAR ALGEBRA KERNELS TO BUILD AN EFFICIENT FINITE ELEMENT SOLVER
by H. C. Elman, D. K-y Lee, Howard C. Elman, Dennis, K. -y. Lee 1992

Table 3. Performance indices obtained from the LROC analysis of the compressed data. An average of 12% improvement was observed in localization accuracy with the compressed re- constructed images.

in Observer Evaluations of Wavelet Methods for the Enhancement and Compression of Digitized
by Maria Kallergi, John J. Heine, Bradley J. Lucier

Table 7: Triangle construction time (in seconds) for the Rage256 data set, with and without local caching.

in Isosurface Extraction in Time-varying Fields Using a Temporal Branch-on-Need Tree (T-BON)
by Philip Sutton, Charles D. Hansen 2000
Cited by 21

Table 1: Triangle construction time (in seconds) for the Rage256 data set, with and without local caching.

in Isosurface Extraction in Time-varying Fields Using a Temporal Branch-on-Need Tree (T-BON)
by Philip Sutton, Charles D. Hansen 2000
Cited by 21

Table 2: Triangle construction time (in seconds) for the Jet256 data set, with and without local caching.

in Isosurface Extraction in Time-varying Fields Using a Temporal Branch-on-Need Tree (T-BON)
by Philip Sutton, Charles D. Hansen 2000
Cited by 21
Results 1 - 10 of 21,859