Results 251 to 260 of about 3,910,298 (308)
Some of the next articles are maybe not open access.

Parallel Scheduling Algorithms

Operations Research, 1983
Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms.
Eliezer Dekel, Sartaj Sahni
openaire   +2 more sources

PARALLEL ARCHITECTURES AND INTRINSICALLY PARALLEL ALGORITHMS: GENETIC ALGORITHMS

International Journal of Modern Physics C, 1994
Genetic algorithms are search or classification algorithms based on natural models. They present a high degree of internal parallelism. We developed two versions, differing in the way the population is organized and we studied and compared their characteristics and performances when applied to the optimization of multidimensional function problems ...
R. CAMPANINI   +4 more
openaire   +2 more sources

Algorithms for parallel boosting

Fourth International Conference on Machine Learning and Applications (ICMLA'05), 2006
We present several algorithms that combine many base learners trained on different distributions of the data, but allow some of the base learners to be trained simultaneously by separate processors. Our algorithms train batches of base classifiers using distributions that can be generated in advance of the training process. We propose several heuristic
Fernando Lozano, Pedro Rangel
openaire   +2 more sources

A parallel median algorithm

Information Processing Letters, 1985
We give a deterministic algorithm for finding the k th smallest item in a set of n items, running in O((log log n)\({}^ 2)\) parallel time on O(n) processors in Valiant's comparison model.
Richard Cole 0001, Chee-Keng Yap
openaire   +1 more source

Parallel Numerical Algorithms

2010
Robust and efficient parallel numerical algorithms and their implementation in easy-to-use portable software components are crucial for computational science and engineering applications. They are strongly influenced by the remarkable progress in the development of parallel computer systems.
Amestoy P   +4 more
openaire   +2 more sources

Measuring parallelism in algorithms

Microprocessing and Microprogramming, 1992
Abstract Parallel algorithms can be represented by task graphs from which it is easy to obtain the degree of simultaneousness and the degree of connection of the algorithms. The above mentioned degrees are very important features of parallel algorithms.
Borut Jereb, Ljubo Pipan
openaire   +2 more sources

Structuring of Parallel Algorithms

Journal of the ACM, 1968
The structuring of algorithms suitable for execution on parallel processors is discussed. Two examples of such algorithms are given. The first example exhibits a restructuring of Bellman's dynamic programming technique; the second presents a method of parsing MAD-type statements in parallel.
openaire   +1 more source

PARALLEL ALGORITHMS FOR CONTROL

IFAC Proceedings Volumes, 1992
Abstract Two classes of concurrent algorithm for real-time Kalman filtering are presented in order to illustrate some algorithm engineering concepts. One is based on systolic computation, and fine-grained algorithms are derived for both regular and square-root covariance Kalman filtering.
openaire   +1 more source

Parallel clustering algorithms

Parallel Computing, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaobo Li 0001, Zhixi Fang
openaire   +2 more sources

Home - About - Disclaimer - Privacy