Results 11 - 20 of 1,274

Table 3. Performance Enhancement (Fibonacci).

in An Efficient Load-Balancing Framework Based on Lazy Partitioning of Sequential Programs
by Masahiro Yasugi, Tsuneyasu Komiya, Taiichi Yuasa
"... In PAGE 16: ...1 Performance Enhancement and Comparison In the following, the results on the SPARC are measured on 750MHz Ultra- SPARC-III. Table3 and Table 4 show the results of GCC enhancement for eliminating trampolines by using closures and L-closures . The tables also present the measured performance of Cilk 5.... ..."

Table 3: Learning contingencies across gaps (revisited)

in Induction of Multiscale Temporal Structure
by Michael Mozer Department, Michael C. Mozer 1992
"... In PAGE 6: ... A reduced description network had no problem learning the contingency across wide gaps. Table3 compares the results presented earlier for a standard net with ten context units and the results for an RD net having six standard context units ( = 0) and four units having identical nonzero , in the range of .... ..."
Cited by 62

Table I. Success Revisited Program Seminar Schedule

in unknown title
by unknown authors

Table 5: Encoding of -calculus operators and types, revisited

in Controlling Interference in Ambients
by Francesca Levi, Davide Sangiorgi
"... In PAGE 11: ... This is in general quite restrictive, because ambients form a hierarchical structure, in which I/O requests may be arbitrarily deep. Table5 shows an encoding that does not su er these problems; the solution adopted in [7] called the coalescing encoding is behaviourally quite di erent. Both input and output requests along channel p are represented by ambients called p.... In PAGE 11: ...[in p.open p. (q1. . qn). open p. [[P]] ] j open p This complicates however the correctness proof (we would need for instance type systems for linear types). In the encoding of Table5 , coactions guarantee that ex- actly one output ambient enters an input one and, in the simpler input clause above, they control when the input am- bient is opened. 7 Related work and conclusions The introduction of coactions has been inspired by the SOS... ..."

TABLE 10 Mean Number of Revisitations per Data Item/Hypotheses and the Mean Page and Segment Spans per Revisitation

in An Experimental Study of the Effects of Representational Guidance on Collaborative Learning
by Daniel D. Suthers, Christopher D. Hundhausen 2003
Cited by 2

Table 1. Factorization of first 25 Fibonacci numbers

in unknown title
by unknown authors

Table 2: Illustration of Fibonacci F (n) complements

in Zeckendorf Integer Arithmetic
by Peter Fenwick
"... In PAGE 7: ...sign-fill pattern of 101010 . . ., whose alignment with respect to the signifi- cant bits is not easily decided. Some complements are shown in Table2 . We see that a negative number is characterised by a leading 1010 .... ..."

Table 3: Execution time of Fibonacci program

in Using Object-Oriented Attribute Grammars as ODB System Generator
by T. Hagiwara, K. Gondow, T. Imaizumi, T.Katayama
"... In PAGE 12: ...in = 10 to 12. Table3 shows result of this test. The di erence of execution time between non-DB and DB version widen as the number of objects, but it is proper result taking into consideration of character of the program it creates and deletes many objects frequently.... ..."

Table 2. Fibonacci-p-codes

in Discrete Orthogonal Transforms Based on Fibonacci-type Recursions
by Karen Egiazarian, Jaakko Astola

Table 3: Execution time of Fibonacci program

in Using Object-Oriented Attribute Grammars as ODB System Generator
by T. Hagiwara, K. Gondow, T. Imaizumi, T. Katayama
"... In PAGE 12: ...in = 10 to 12. Table3 shows result of this test. The di erence of execution time between non-DB and DB version widen as the number of objects, but it is proper result taking into consideration of character of the program it creates and deletes many objects frequently.... ..."
Results 11 - 20 of 1,274