Results 1 - 10 of 51,481

Table 2: Raising related beliefs

in unknown title
by unknown authors 2000
"... In PAGE 4: ...e. exp(B)) can be tabulated in Table2 . Based on the maxi-adjustment al-... ..."
Cited by 1

Table 2. Raising related beliefs

in A Logic-Based Approach for Adaptive Information Filtering Agents
by Raymond Lau, Arthur H.M. ter Hofstede, Peter D. Bruza 2001
"... In PAGE 7: ...e. exp(B)) can be tabulated in Table2 . Based on the maxi-adjustment algorithm, B+( ; i)( ) = i if B( ) i lt; degree(B; ! ).... ..."
Cited by 2

TABLE III PERFORMANCE OF COHERENCE BASED METHOD

in Automatic scene extraction in motion pictures
by Ba Tu Truong, Svetha Venkatesh, Chitra Dorai, Ba Tu 2003
Cited by 5

TABLE IV IMPROVEMENTS FOR THE COHERENCE BASED METHOD

in Automatic scene extraction in motion pictures
by Ba Tu Truong, Svetha Venkatesh, Chitra Dorai, Ba Tu 2003
Cited by 5

TABLE 2 Number of Template-Based Beliefs (Out of 38)

in Can tutors monitor students’ understanding accurately
by Michelene T. H. Chi, Stephanie A. Siler, Heisawn Jeong 2004
Cited by 2

Table 1: Rule expression matrix for a belief rule-base

in A Safety-Cost Based Design-Decision Support Framework Using Fuzzy Evidential Reasoning Approach
by Jun Liu, Jian-bo Yang, Jin Wang, How-sing Sii

Table 6: Rule Base Expressed as a Decision Table Inputs Rules

in unknown title
by unknown authors 1997
"... In PAGE 19: ... After a mapping is obtained, the second step in concept formation is to convert the decision table into a compressed form. The compressed decision table for the credit granting rule base is shown in Table6 . We note that a compressed decision table is not the only representation of concepts suitable for cost optimization.... ..."
Cited by 4

Table 1: Differences in hardware and compiler-based cache coherence schemes.

in Improving Memory Utilization in Cache . . .
by David J. Lilja, Pen-chung Yew
"... In PAGE 21: ... Table1 0: Normalized memory overhead. Scheme Overhead, Ox 1.... In PAGE 25: ...models in Table1 0, its memory overhead grows as O(p). The memory overhead of the 2-bit broadcast scheme is fixed, independent of the number of processors, but the additional messages needed for the broadcasts as p increases will seriously degrade its performance.... In PAGE 25: ... Unlike software-only coherence schemes, this compiler-assisted scheme still can use the full power of the directory when the compiler is unable to determine the precise sharing characteristics of a particular block. As summarized in Table1 2, the pointer cache directory performs as well as any of the current directory schemes while using only a small fraction of the memory that the other directory schemes need to store the pointer information. The memory overhead of the software-directed version control scheme with imprecise memory disambiguation is less than a factor of 10 times greater than that of the pointer cache, but the pointer cache produces lower memory delays due to its perfect memory disambiguation.... In PAGE 26: ... Table1 2: Performance and memory overhead comparisons. Coherence scheme Compared to the pointer cache Average delay Memory overhead 1.... In PAGE 34: ...Table1 1: Average memory delay and memory overhead. (a) arc3d Configuration No compiler opts.... In PAGE 35: ...Table1 1: (cont.) (c) simple24 Configuration No compiler opts.... In PAGE 36: ...Table1 1: (cont.) (e) flo52 Configuration No compiler opts.... ..."

Table 1: Differences in hardware and compiler-based cache coherence schemes.

in Improving Memory Utilization in Cache Coherence Directories
by David J. Lilja, Pen-Chung Yew
"... In PAGE 21: ... Table1 0: Normalized memory overhead. Scheme Overhead, Ox 1.... In PAGE 25: ...models in Table1 0, its memory overhead grows as O(p). The memory overhead of the 2-bit broadcast scheme is fixed, independent of the number of processors, but the additional messages needed for the broadcasts as p increases will seriously degrade its performance.... In PAGE 25: ... Unlike software-only coherence schemes, this compiler-assisted scheme still can use the full power of the directory when the compiler is unable to determine the precise sharing characteristics of a particular block. As summarized in Table1 2, the pointer cache directory performs as well as any of the current directory schemes while using only a small fraction of the memory that the other directory schemes need to store the pointer information. The memory overhead of the software-directed version control scheme with imprecise memory disambiguation is less than a factor of 10 times greater than that of the pointer cache, but the pointer cache produces lower memory delays due to its perfect memory disambiguation.... In PAGE 26: ... Table1 2: Performance and memory overhead comparisons. Coherence scheme Compared to the pointer cache Average delay Memory overhead 1.... In PAGE 34: ...Table1 1: Average memory delay and memory overhead. (a) arc3d Configuration No compiler opts.... In PAGE 35: ...Table1 1: (cont.) (c) simple24 Configuration No compiler opts.... In PAGE 36: ...Table1 1: (cont.) (e) flo52 Configuration No compiler opts.... ..."

Table 1: Differences in hardware and compiler-based cache coherence schemes.

in Improving Memory Utilization in Cache Coherence Directories
by David Lilja, Pen-chung Yew
"... In PAGE 21: ... Table1 0: Normalized memory overhead. Scheme Overhead, Ox 1.... In PAGE 25: ...models in Table1 0, its memory overhead grows as O(p). The memory overhead of the 2-bit broadcast scheme is fixed, independent of the number of processors, but the additional messages needed for the broadcasts as p increases will seriously degrade its performance.... In PAGE 25: ... Unlike software-only coherence schemes, this compiler-assisted scheme still can use the full power of the directory when the compiler is unable to determine the precise sharing characteristics of a particular block. As summarized in Table1 2, the pointer cache directory performs as well as any of the current directory schemes while using only a small fraction of the memory that the other directory schemes need to store the pointer information. The memory overhead of the software-directed version control scheme with imprecise memory disambiguation is less than a factor of 10 times greater than that of the pointer cache, but the pointer cache produces lower memory delays due to its perfect memory disambiguation.... In PAGE 26: ... Table1 2: Performance and memory overhead comparisons. Coherence scheme Compared to the pointer cache Average delay Memory overhead 1.... In PAGE 34: ...Table1 1: Average memory delay and memory overhead. (a) arc3d Configuration No compiler opts.... In PAGE 35: ...Table1 1: (cont.) (c) simple24 Configuration No compiler opts.... In PAGE 36: ...Table1 1: (cont.) (e) flo52 Configuration No compiler opts.... ..."
Results 1 - 10 of 51,481