نتایج جستجو برای: parallel genetic algorithms
تعداد نتایج: 1104270 فیلتر نتایج به سال:
for many years, researchers have studied high accuracy methods for recognizing the handwriting and achieved many significant improvements. however, an issue that has rarely been studied is the speed of these methods. considering the computer hardware limitations, it is necessary for these methods to run in high speed. one of the methods to increase the processing speed is to use the computer pa...
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
in this paper an application of cellular learning automata (cla) to vlsi placement is presented. the cla, which is introduced for the first time in this paper, is different from standard cellular learning automata in two respects. it has input and the cell neighborhood varies during the operation of cla. the proposed cla based algorithm for vlsi placement is tested on number of placement proble...
in this paper, we study different methods of solving joint redundancy-availability optimization for series-parallel systems with multi-state components. we analyzed various effective factors on system availability in order to determine the optimum number and version of components in each sub-system and consider the effects of improving failure rates of each component in each sub-system and impr...
Heuristic algorithms are usually employed to find an optimal solution to NP-Complete problems. Genetic algorithms are among such algorithms and they are search algorithms based on the mechanics of natural selection and genetics. Since genetic algorithms work with a set of candidate solutions, parallelisation based on the SIMD paradigm seems to be the natural way to obtain a speed up. In this ap...
The genetic algorithm is an iterative random search technique for nonlinear or combi-natorial problems. In this contribution, rst the development from the classical genetic algorithm (GA) via the parallel genetic algorithm (PGA) to the massively parallel genetic algorithm (MPGA) is described. Then experimental results with an implementation of the MPGA on the array processor MasPar MP-1 are dis...
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید