### Table 1: Processing throughput in MVoxels/s for the GPU and CPU implementation of the diffusion-based region growing algorithm.

2005

Cited by 2

### Table 1: Processing throughput in MVoxels/s for the GPU and CPU implementation of the diffusion-based region growing algorithm.

2005

Cited by 2

### Table 4: Some parallel genetic algorithm implementations. Platform GA type Topology Researcher/year

"... In PAGE 63: ... For this reason the scope of many parallel genetic algorithm implementations and experiments is to find out how the population should be divided into parallel processors and how possible sub-populations should interact for quick convergence. Some experiments are listed in Table4 , where it can be seen how the same platform have been used to study different topologies for centralized, distributed and network model parallel genetic algorithms [44]. The most popular computing platforms have been transputer-based systems, which is no wonder due to their low cost and simple interconnection scheme [125].... ..."

### Table 1: Evolution of scheduling algorithms with parallel and distributed computing systems

2006

"... In PAGE 4: ... Looking back at such efforts, we find that scheduling algorithms are evolving with the architecture of parallel and distributed systems. Table1 captures some important features of parallel and distributed systems and typical scheduling algorithms they adopt. ... ..."

### Table 1: Evolution of scheduling algorithms with parallel and distributed computing systems

2006

"... In PAGE 4: ... Looking back at such efforts, we find that scheduling algorithms are evolving with the architecture of parallel and distributed systems. Table1 captures some important features ... ..."

### Table 1 Algorithmic CPU-GPU comparison

"... In PAGE 9: ... Concerning operations all standard mathematical functions are available but conditionals should be avoided inside of loops. Table1 also presents a summary of the main properties. 4 Scientific Computations on the GPU Data in scientific computations is often represented in arrays and large data regions undergo the same operations.... ..."

### Table 2: Statistics concerning the GPU-based visibility algorithm.

2005

"... In PAGE 10: ...3). Table2 summarizes the statistics of the GPU visibility algorithm. The rst column shows the name and number of polygons used in the test (i.... ..."

Cited by 5

### Table 1: Complexities of algorithms implemented with SAM Histogram FFT Median lter

### Table 2: Statistics concerning the GPU-based visibility algorithm.

2005

"... In PAGE 10: ...3). Table2 summarizes the statistics of the GPU visibility algorithm. The rst column shows the occluder name and speci es the number of polygons used to model it (i.... ..."

Cited by 5

### Table 2: Comparison of Parallel -based Game-Tree Search Implementations

"... In PAGE 3: ... 2.2 Comparison of the Implementations Table2 summarizes an implementation of each algorithm given in Table 1. The rst column gives the name of the algorithm, and the reference to the paper that contains the details about the implementation.... In PAGE 10: ... By always selecting only one candidate move, DM-PVSplit generalizes into PV-Split. Since the PV set does not respect the structure of the minimal tree, the last two columns in Table2 re ect this by referring to the PV set, and not Knuth and Moore apos;s classi cation of minimal tree nodes. The algorithm is designed for use on strongly ordered trees.... ..."