L. Kronsjo, D. Shumsheruddin, "Advances in Parallel Algorithms", Blackwell Scientific Publications, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Minimal Strings Containing the Elements of ${S}_{n}$ by .. - Erra, Lygeros, Stewart (2001) (Correct)
....search space. This provides a feasible search space for n 5, an incremental improvement at best. NNR CPU Time 187 31 0.07 sec 7M 28,501 1.69 sec 5 19 2 10 13 18 hour 3. 3 Genetic Algorithm approach Based on an abstract model of biological evolution, the Genetic Algorithm[4][9] (GA) is a general adaptive search technique. A population of candidate solutions are evolved under selective pressure towards better solutions. This selective pressure often takes the form a fitness function (or objective function) Genetic operators such as sexual reproduction and mutation are ....
L. Kronsjo, D. Shumsheruddin, "Advances in Parallel Algorithms", Blackwell Scientific Publications, 1992.
A Bookkeeping Strategy for Multiple Objective Linear Programs - Alok Aurovillian Hong (Correct)
....for Parallel ADBASE with the BSIS list creation scheme will be referred to as PADBASE and PADBASE BSIS, respectively. In developing a parallel algorithm, one tries to achieve the shortest execution time by dividing the problem into several sub tasks to be executed concurrently on multicomputers [10] [11] The computational time of any program can be split into a global time T g , that cannot be distributed among processors, and a local time T l , that can be executed simultaneously on all processors. Thus, the total execution time using p processors, T p , can be represented as: T p = T g ....
L. Kronsjo and D. Shumsheruddin, eds., Advances in Parallel Algorithms, John Wiley & Sons, New York, 1992.
DAFS: Supporting the knowledge discovery process - McLaren, Babb (1997) (1 citation) (Correct)
....flexibility and portability, and the ease of integration with the rest of the knowledge discovery process. The approach taken to parallelise the back propagation and Kohonen network functions is to train the same network on the different data sets on each processor using batch mode learning [12], as illustrated in figure 3. This involves the master generating the initial weights of the network and passing these to the slave processes. Each slave then trains its copy of the network on the data set which it holds for one training epoch. The cumulative weight changes for each slave are then ....
L. Kronsjo and D. Shumsheruddin. Advances in Parallel Algorithms. Blackwell Scientific, 1992.
On Minimal Strings Containing the Elements of S n by.. - Erra, Lygeros, Stewart (2001) (Correct)
No context found.
L. Kronsjo, D. Shumsheruddin, "Advances in Parallel Algorithms", Blackwell Scientific Publications, 1992.
Investigation of Parallel Computations: Machines, Tools and.. - Togneri (1994) (Correct)
No context found.
Lydia Kronsjo and Dean Shumsheruddin, "Advances in Parallel Algorithms", Blackwell Scientific Publications, 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC