Analysis of crossovers and selections in a coarse-grained parallel genetic algorithm
نویسندگان
چکیده
منابع مشابه
Clustering using a coarse - grained parallel Genetic Algorithm : APreliminary
Genetic Algorithms (GA) are useful in solving complex optimization problems. By posing pattern clustering as an optimization problem, GAs can be used to obtain an optimal minimum squared-error partitions. In order to improve the total execution time, a distributed algorithm has been developed using the divide and conquer approach. Using a standard communication library called PVM, the distribut...
متن کاملCoarse-Grained Parallel Genetic Algorithm for Solving the Timetable Problem
This work studies the application of Genetic Algorithm (GA) to solve the timetable problem (TTP), a problem that is a highly constrained problem. However, the major disadvantage of GA is that the algorithm uses a tremendous amount of processing time. This paper proposes a method that can reduce the processing time by using Parallel Genetic Algorithm (PGA) on the Beowulf-style cluster computer. ...
متن کاملA Range Minima Parallel Algorithm for Coarse Grained Multicomputers
Given an array of n real numbers A = (a1; a2; : : : ; an), de ne MIN(i; j) = minfai; : : : ; ajg. The range minima problem consists of preprocessing array A such that queries MIN(i; j), for any 1 i j n, can be answered in constant time. Range minima is a basic problem that appears in many other important problems such as lowest common ancestor, Euler tour, pattern matching with scaling, etc. In...
متن کاملa contrastive analysis of concord and head parameter in english and azerbaijani
این پایان نامه به بررسی و مقایسه دو موضوع مطابقه میان فعل و فاعل (از نظر شخص و مشار) و هسته عبارت در دو زبان انگلیسی و آذربایجانی می پردازد. اول رابطه دستوری مطابقه مورد بررسی قرار می گیرد. مطابقه به این معناست که فعل مفرد به همراه فاعل مفرد و فعل جمع به همراه فاعل جمع می آید. در انگلیسی تمام افعال، بجز فعل بودن (to be) از نظر شمار با فاعلشان فقط در سوم شخص مفرد و در زمان حال مطابقت نشان میدهند...
15 صفحه اولThe Saukas-Song Selection Algorithm and Coarse Grained Parallel Sorting
We analyze the running time of the Saukas-Song algorithm for selection on a coarse grained multicomputer without expressing the running time in terms of communication rounds. We derive sorting algorithms that are asymptotically optimal for restricted ranges of processors on coarse grained multicomputers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2003
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(03)90129-4