Results 1 - 10 of 51,887

Table 1: Execution time (in seconds) for several con gurations

in Execution Analysis of DSM Applications: A Distributed and Scalable Approach
by Lionel Brunie, Laurent Lefèvre, Olivier Reymann 1996
"... In PAGE 8: ... 4 workstations each one holding one Application Pro- cess, one Memory Process plus another workstation holding only an Event Manager Process which collects the events from all the MPs. Table1 shows the execution time obtained on these var- ious system con gurations. Obviously, the three monitoring con gurations do not provide the same results.... ..."
Cited by 5

Table 1. Timing results (in seconds) for several data sets.

in Euclidean skeletons of 3D data sets in linear time by the integer medial axis transform
by Wim H. Hesselink, Menno Visser, Jos B. T. M. Roerdink 2005
"... In PAGE 8: ...esults are given for three 3D data sets, i.e. CT scans of a head, a tooth and a number of blood vessels. The size of these sets and their timing results are given in Table1 . These results were obtained on an 1.... ..."
Cited by 4

TABLE 2. Transfer rate (kilowords per second) of several

in unknown title
by unknown authors 1988

Table 5: Idle time, in seconds, for several values p and table size.

in Asynchronous Analysis of Parallel Dynamic Programming Algorithms
by Gary Lewandowski, Anne Condon, Eric Bach

Table 3 Effect on performance (time in seconds) by relaxing the severity of the approximation

in Invited Talk Beyond Single Cluster Reachability Analysis
by Gerd Behrmann, Kim G. Larsen
"... In PAGE 45: ... 5.3 Effect of under-approximation Table3 shows the effect of relaxing the approximation, by picking more states at each step (call this m). In our experimental runs, we varied m from 1 to 5 for each circuit.... In PAGE 109: ...e. Table3 (b). However, the performance of the deterministic program is better than the non-deterministic version in the hard circuits in Table 3 (a).... In PAGE 109: ...imilar to the deterministic program in the simple circuits, i.e. Table 3 (b). However, the performance of the deterministic program is better than the non-deterministic version in the hard circuits in Table3 (a). Therefore, we strongly prefer the deterministic version to the non-deterministic version.... ..."

Table 4 Effect on performance (time in seconds) by drastically relaxing the severity of the approximation

in Invited Talk Beyond Single Cluster Reachability Analysis
by Gerd Behrmann, Kim G. Larsen
"... In PAGE 45: ... In our experimental runs, we varied m from 1 to 5 for each circuit. Table4 shows the effect of drastically relaxing the under-approximation, by 12... ..."

Table 3.2: A sample of Lycos clickthrough records|user query and the selected URL|during a several-second window in February, 2000.

in Statistical Machine Learning for Information Retrieval
by Adam Berger, Daniel Sleator 2001
Cited by 2

Table 1: Running times in seconds for several implementations of the following query: #5Cretrieve the o#0Ecial

in K2Kleisli and GUS: Experiments in Integrated Access to Genomic Data Sources
by Susan B. Davidson, Jonathan Crabtree, Brian Brunk, Jonathan Schug, Val Tannen, Chris Overton, Chris Stoeckert 2001
"... In PAGE 15: ... Exactly howmuch faster a warehouse query will run compared to an equivalent query in a view integration system depends on many factors, including the nature of the query and the number and types of source databases that must be accessed. Table1 presents some relevant performance data gathered in mid-1995 using an earlier version of the K2#2FKleisli system discussed in Section 2. This example illustrates the performance gains that can be realized by using a relational warehouse #28#0Crst row#29.... ..."
Cited by 42

Table 1: Performance improvement obtained with the strength reduction of modulo and division operations on several machines. Results are measured in seconds.

in Strength Reduction of Integer Division and Modulo Operations
by Saman Amarasinghe, Walter Lee, Ben Greenwald
"... In PAGE 2: ... Similarly, Figure 1c and Figure 1d show a loop with an integer divide operation before and after optimizations. Table1 and Figure 2 shows the performance of these loops on a wide range of processors. The results show that the performance gain is universally significant, generally ranging from 4.... ..."

Table 1: Response time in clock cycles for a preemp- tion during second activation for several benchmarks and cache sizes

in th Intl WORKSHOP ON WORST-CASE EXECUTION TIME (WCET) ANALYSIS
by Catania Sicily Italy, H. S. Negi, A. Roychoudhuri, T. Mitra, J. Staschulat, R. Ernst, Technische Universitaet Braunschweig, A. Rakib, O. Parshin, S. Thesing, R. Wilhelm 2004
"... In PAGE 17: ... Pulse Code Modulation G.721 Speech encoding and decoding, reference implementation of the CCITT Multi Sort Combination of sorting algorithms Table1 : Benchmarks 0 16 32 64 128 256 512 1024 2048 4096 0 250 500 750 1000 1250 1500 1750 2000 2250 2500 2750 3000 3250 3500 3750 4000 Execution Time vs. WCET (G.... In PAGE 25: ... 4.1 Multiple process execution Table1 presents the response time for different cache architectures and benchmarks in terms of clock cycles. A 2-way associative 1024 Byte cache with 8 Byte block size is denoted as 1024-8-2.... In PAGE 38: ...Table1 : The number of loops with a certain nesting level. Level Global count Local count Scope count 0 68927 574 0 1 51262 53 384 2 8985 1 1771 3 250 9036 4 106 14919 5 32 28467 6 36138 7 26834 8 10893 9 1056 10 64 Table 2: Re-use of functions.... ..."
Results 1 - 10 of 51,887