Results 1 - 10 of 32,951

Table 3 Optimal scaling parameters.

in Numerical Condition Of Discrete Wavelet Transforms
by Radka Turcajová

Table 3 Optimal scaling parameters.

in unknown title
by unknown authors

TABLE 4: Optimized Scaling Factorsa

in Vibrational Assignment of All 46 Fundamentals of C60 and C60 6-: Scaled Quantum Mechanical Results Performed in Redundant Internal Coordinates and Compared to Experiments
by Cheol Ho Choi, Miklos Kertesz

Table 1. Comparison of results for various approaches.

in Generating (n,2) De Bruijn Sequences with Some Balance and Uniformity Properties
by Yi-chih Hsieh, Han-Suk Sohn, Dennis L. Bricker
"... In PAGE 8: ... 4. Numerical Results Table1 compares the balance and uniformity (t,s) of (n,2) de Bruijn sequences... In PAGE 9: ... In the case of Algorithm II, the characteristics of the sequences obtained by the optimal mappings with respect to both balance and uniformity criteria are shown. ------------------------- Table1 goes here ------------------------- In Table 1, we observe that: 1. Although Algorithm I generates sequences with optimal uniformity (minimum s), the corresponding balance criterion t is rather large.... In PAGE 9: ... In the case of Algorithm II, the characteristics of the sequences obtained by the optimal mappings with respect to both balance and uniformity criteria are shown. -------------------------Table 1 goes here ------------------------- In Table1 , we observe that: 1. Although Algorithm I generates sequences with optimal uniformity (minimum s), the corresponding balance criterion t is rather large.... ..."

Table 1. Performance Characteristics of Different AM Implementations

in Enabling a PC Cluster for High-Performance Computing
by Hermann Hellwagner, Wolfgang Karl, Markus Leberecht, Technische Universitt Mnchen 1997
"... In PAGE 7: ...ficient, buffered writes in the SCI DSM only. Performance measurements on the UCSB SCI cluster show competitive performance behavior of the SCI AM system ( Table1 ). Our own implementation, depicted in the first row of Table 1, adds little over- head to the raw latency of 9.... ..."
Cited by 13

Table 3b. Solution Statistics for Model 2 (Minimization)

in unknown title
by unknown authors 1999
"... In PAGE 4: ...6 Table 2. Problem Statistics Model 1 Model 2 Pt Rows Cols 0/1 Vars Rows Cols 0/1 Vars 1 4398 4568 4568 4398 4568 170 2 4546 4738 4738 4546 4738 192 3 3030 3128 3128 3030 3128 98 4 2774 2921 2921 2774 2921 147 5 5732 5957 5957 5732 5957 225 6 5728 5978 5978 5728 5978 250 7 2538 2658 2658 2538 2658 120 8 3506 3695 3695 3506 3695 189 9 2616 2777 2777 2616 2777 161 10 1680 1758 1758 1680 1758 78 11 5628 5848 5848 5628 5848 220 12 3484 3644 3644 3484 3644 160 13 3700 3833 3833 3700 3833 133 14 4220 4436 4436 4220 4436 216 15 2234 2330 2330 2234 2330 96 16 3823 3949 3949 3823 3949 126 17 4222 4362 4362 4222 4362 140 18 2612 2747 2747 2612 2747 135 19 2400 2484 2484 2400 2484 84 20 2298 2406 2406 2298 2406 108 Table3 a. Solution Statistics for Model 1 (Maximization) Pt Initial First Heuristic Best Best LP Obj.... In PAGE 5: ...) list the elapsed time when the heuristic procedure is first called and the objective value corresponding to the feasible integer solution returned by the heuristic. For Table3 a, the columns Best LP Obj. and Best IP Obj.... In PAGE 5: ... report, respectively, the LP objective bound corresponding to the best node in the remaining branch-and-bound tree and the incumbent objective value corresponding to the best integer feasible solution upon termination of the solution process (10,000 CPU seconds). In Table3 b, the columns Optimal IP Obj., bb nodes, and Elapsed Time report, respectively, the optimal IP objective value, the total number of branch-and-bound tree nodes solved, and the total elapsed time for the solution process.... ..."

Table 2: Technology Mapping results

in A Rapid Boolean Technology Mapping applicable to Power Minimization
by Ricardo Ferreira, A-m. Trullemans, Ricardo Jacobi
"... In PAGE 8: ... The results show that the Boolean approach reduces the number of matching algorithm calls, nd smaller area circuits in better CPU time, and reduces the initial network graph because generic 2-input base function are used. Table2 presents a comparison between SIS and Land for the library 44-2.genlib, which is distributed with the SIS package.... ..."

Table 1. Optimal scaling factors for the LBT

in Fast progressive image coding without wavelets
by Henrique S. Malvar 2000
Cited by 13

TABLE 2: Optimized Scale Parameters by Atom Type

in Parametrized models of aqueous free energies of solvation based on pairwise descreening of solute atomic charges from a dielectric medium
by Gregory D. Hawkins, Christopher J. Cramer, Donald G. Truhlar 1996
Cited by 8

Table 8. Optimal scaling parameters and condition numbers for ME.

in Fitting Scattered Data on Sphere-Like Surfaces using Spherical Splines
by Peter Alfeld 1996
"... In PAGE 35: ... The second column labeled C gives the improved condition numbers obtained by using the associated value of in column 3. In Table8 the fourth and fth columns list the smallest (nonzero) and largest entries in the matrix Q, while the the last column gives the number of equations in the system. In Table 9 the fourth and fth columns list the smallest... ..."
Cited by 35
Results 1 - 10 of 32,951