Results 1 - 10 of 2,112

Table 4 Utopian Sample Comparisons

in Spearman’s (1904) “‘General Intelligence, ’ Objectively Determined and Measured”
by David Lubinski
"... In PAGE 6: ... Cognitive differences make real life differences. Finally, Table4 does not use a sibling control; it uses a different kind of control. Here, a variety of outcomes are examined for the full NLSY sample (N H11005 12,686) across the same five general ability gradations.... ..."

Table-7 Utopian Objective Values

in GENETIC ALGORITHM FOR PERSONNEL ASSIGNMENT PROBLEM WITH MULTIPLE OBJECTIVES
by Yılmaz Arslanoğlu

Table 5: Universal and Ideal thresholding Universal Ideal

in The Discrete Multiple Wavelet Transform and Thresholding Methods
by Downie Silverman, T. R. Downie, B. W. Silverman 1998
"... In PAGE 23: ... Figure 8 shows estimates after thresholding with Daubechies and Geronimo wavelets. Table5 compares the universal threshold with the ideal threshold, the ideal threshold being the value which gives the smallest MSE with the number of levels to be thresholded xed. The MSE for the universal threshold with the Geronimo multiwavelets is very similar to the MSE for the ideal threshold despite the threshold values being reasonably di erent.... ..."
Cited by 23

Table 1. Ideal configuration

in Data-Flow Prescheduling for Large Instruction Windows in Out-of-Order Processors
by Pierre Michaud, Andre Seznec 2001
"... In PAGE 2: ... Branch misprediction re- covery is performed as soon as a mispredicted branch is ex- ecuted. The cache latencies reported in Table1 and 2 are futur- istic values anticipating smaller feature sizes [1].... ..."
Cited by 66

Table 4: Ideal Speedup.

in Comparing Static And Dynamic Code Scheduling for Multiple-Instruction-Issue Processors
by Pohua Chang, William Y. Chen, Scott A. Mahlke, Wen-mei W. Hwu 1991
"... In PAGE 5: ... Each column of Tables 4 through 6 is labeled XY Z, where X is the issue rate, Y indicates either restricted (r) or general (g) code percolation, and Z indicates in-order (i) or out-of-order (o) execution. Ideal Cache Results Figure 1 and Table4 present speedup results for an in - nite rst level data cache. Overall, restricted out-of-order execution performs slightly better than general in-order execution.... ..."
Cited by 18

Table 4: Ideal Speedup.

in Comparing Static And Dynamic Code Scheduling for Multiple-Instruction-Issue Processors
by Pohua P. Chang, William Y. Chen, Scott A. Mahlke, Wen-mei W. Hwu 1991
"... In PAGE 5: ... Each column of Tables 4 through 6 is labeled XY Z, where X is the issue rate, Y indicates either restricted (r) or general (g) code percolation, and Z indicates in-order (i) or out-of-order (o) execution. Ideal Cache Results Figure 1 and Table4 present speedup results for an in - nite rst level data cache. Overall, restricted out-of-order execution performs slightly better than general in-order execution.... ..."
Cited by 18

Table 1: Worksheet for comparing motion sensor networks (left) to camera networks (right). Within each column, left is the utopian case, while the right is the dystopian case. Bold indicates divergence.

in Worse is better for ambient sensing
by Carson J. Reynolds, Christopher R. Wren 2006
"... In PAGE 6: ... We imagine a system designed to improve elevator efficiency by sensing building occupants and predicting demand for service. In Table1 we show a summary of the system situated in a multi-dimensional metaethics space. The left block is an evaluation of a sensor network based on motion detec- tors.... In PAGE 8: ...3 Dystopia These differences become more pronounced when we shift to the dystopian world view. These dimensions are in bold typeface on Table1 . If we imagine that the system could be co-opted by a totalitarian government for the purposes of monitoring its citizens, then it becomes very important what type of information the sensors are actually collecting.... ..."
Cited by 5

Table 4: Ideal Speedup.

in Comparing Static And Dynamic Code Scheduling for Multiple-Instruction-Issue Processors
by Pohua P. Chang, William Y. Chen, Scott A. Mahlke, Wen-mei W. Hwu
"... In PAGE 5: ... Each column of Tables 4 through 6 is labeled XYZ, where X is the issue rate, Y indicates either restricted #28r#29 or general #28g#29 code percolation, and Z indicates in-order #28i#29 or out-of-order #28o#29 execution. Ideal Cache Results Figure 1 and Table4 present speedup results for an in#0C- nite #0Crst level data cache. Overall, restricted out-of-order execution performs slightly better than general in-order execution.... In PAGE 5: ... For these programs, load bypassing at run time allows memory load operations on the critical path to execute early. This resulted in the clear performance advantage of restricted out-of-order execution for lex and qsort #28see Table4 #29. 1 1.... ..."

TABLE I IDEAL CONFIGURATIONS.

in An Efficient Data Transport Protocol for Event-Driven Field-Estimation on Sensor Networks
by Daniel De O. Cunha, Otto Carlos M. B. Duarte, Guy Pujolle

Table 1. Ideal configuration

in Data-Flow Prescheduling for Large Instruction Windows in Out-of-Order Processors
by unknown authors
"... In PAGE 2: ... Branch misprediction re- covery is performed as soon as a mispredicted branch is ex- ecuted. The cache latencies reported in Table1 and 2 are futur- istic values anticipating smaller feature sizes [1].... ..."
Results 1 - 10 of 2,112