This paper presents an adaptive algorithm that can adjust parameters of a geneticalgorithm according to the observed performance. The parameter adaptation occurs in parallel to the running of the geneticalgorithm. T...
详细信息
This paper presents an adaptive algorithm that can adjust parameters of a geneticalgorithm according to the observed performance. The parameter adaptation occurs in parallel to the running of the geneticalgorithm. The proposed method is compared with the algorithms that use random parameter sets and a standard parameter set. The experimental results show that the proposed method offers two advantages over the other competing methods: the reliability in finding the optimal solution and the time required for finding the optimal solution. (C) 2001 Elsevier Science B.V. All rights reserved.
In this paper,a novel parallel evolutionary algorithm called coarse-grained parallel quantum geneticalgorithm(CGPQGA) is *** main points of CGPQGA are that a new chromosome representation called qubit representation,...
详细信息
In this paper,a novel parallel evolutionary algorithm called coarse-grained parallel quantum geneticalgorithm(CGPQGA) is *** main points of CGPQGA are that a new chromosome representation called qubit representation,a novel evolutionary strategy called qubit phase comparison approach and an extended version of coarse-grained model called hierarchical ring model are *** on the concepts and principles of quantum computing and quantum parallelism introduced, CGPQGA is characterized by rapid convergence,good global search capability and the ability of possessing exploration and exploitation *** CGPQGA, the best individual can be easy to migrate to all processors and communication overhead is much less *** experimental results of infinite impulse response digital filter design demonstrate that CGPQGA can speedup the migration of the top individuals of subpopulations and CGPQGA is superior to other several geneticalgorithms greatly in quality and efficiency.
A parallel genetic algorithm is presented to solve the inverse scattering problem which is formulated as an optimal problem where the cost function to be minimized is the energy norm of the residual, i.e. the differen...
详细信息
A parallel genetic algorithm is presented to solve the inverse scattering problem which is formulated as an optimal problem where the cost function to be minimized is the energy norm of the residual, i.e. the difference between the estimated and observed field, and the parameters are the unknown control points for using a spline curve to construct the shape of the object conductor. This approach is computationally heavy since the direct problem needs to be solved in every optimization iteration in order to compute an estimated field. Experiments demonstrate our PGA provides an efficient method for such a problem.
Motivation: RNA H-type pseudoknots are ubiquitous pseudoknots that are found in almost all classes of RNA and thought to play very important roles in a variety of biological processes. Detection of these RNA H-type ps...
详细信息
Motivation: RNA H-type pseudoknots are ubiquitous pseudoknots that are found in almost all classes of RNA and thought to play very important roles in a variety of biological processes. Detection of these RNA H-type pseudoknots can improve our understanding of RNA structures and their associated functions. However, the currently existing programs for detecting such RNA H-type pseudoknots are still time consuming and sometimes even ineffective. Therefore, efficient and effective tools for detecting the RNA H-type pseudoknots are needed. Results: In this paper, we have adopted a heuristic approach to develop a novel tool, called HPknotter, for efficiently and accurately detecting H-type pseudoknots in an RNA sequence. In addition, we have demonstrated the applicability and effectiveness of HPknotter by testing on some sequences with known H-type pseudoknots. Our approach can be easily extended and applied to other classes of more general pseudoknots.
Experimental studies revealed that the elements of the human immunodeficiency virus type 1 (HIV-1) 5'-untranslated leader region (5'-UTR) can fold in vitro into two alternative conformations, branched (BMH) an...
详细信息
Experimental studies revealed that the elements of the human immunodeficiency virus type 1 (HIV-1) 5'-untranslated leader region (5'-UTR) can fold in vitro into two alternative conformations, branched (BMH) and 'linearized' (LDI) and switch between them to achieve different functionality. In this study we computationally explored in detail, with our massively parallel genetic algorithm (MPGAfold), the propensity of 13 HIV-1 5'-UTRs to fold into the BMH and the LDI conformation types. Besides the BMH conformations these results predict the existence of two functionally equivalent types of LDI conformations. One is similar to what has been shown in vitro to exist in HIV-1 LAI, the other is a novel conformation exemplified by HIV-1 MAL long-distance interactions. These novel MPGAfold results are further corroborated by a consensus probability matrix algorithm applied to a set of 155 HIV-1 sequences. We also have determined in detail the impact of various strain mutations, domain sizes and folds of elongating sequences simulating folding during transcription on HIV-1 RNA secondary structure folding dynamics.
As Third Generation (3G) mobile networks start to be implemented, there is a need for effective network planning. However, deciding upon the optimum placement for the base stations of the networks is a complex task re...
详细信息
ISBN:
(纸本)0769520804
As Third Generation (3G) mobile networks start to be implemented, there is a need for effective network planning. However, deciding upon the optimum placement for the base stations of the networks is a complex task requiring vast computational resource. This paper discusses the conflicting objectives of base station planning and characterises a multi-objective optimisation problem. We present a genetic encoding of the third generation mobile network planning problem and parallel genetic algorithms to solve it.
In this paper, a new hybrid of geneticalgorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from the local optima. Then, the idea of hi...
详细信息
ISBN:
(纸本)9781595930101
In this paper, a new hybrid of geneticalgorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from the local optima. Then, the idea of hierarchical parallel GA is borrowed to parallelize GSA for the optimization of multimodal functions. In addition, multi-niche crowding is used to maintain the diversity in the population of parallel GSA. The performance of the proposed algorithms is evaluated against a standard set of multimodal benchmark functions. Multi-niche crowding PGSA and normal PGSA show some remarkable improvement in comparison with the conventional parallel GA and the breeder geneticalgorithm.
In this paper, it is demonstrated how the DNA (DeoxyriboNucleic Acid) operations presented by Adleman and Lipton can be used to develop the parallel genetic algorithm that solves the independent-set problem. The advan...
详细信息
In this paper, it is demonstrated how the DNA (DeoxyriboNucleic Acid) operations presented by Adleman and Lipton can be used to develop the parallel genetic algorithm that solves the independent-set problem. The advantage of the geneticalgorithm is the huge parallelism inherent in DNA based computing. Furthermore, this work represents obvious evidence for the ability of DNA based parallel computing to solve NP-complete problems.
In this paper a methodology for finding the maximal common subgraph of two directed graphs with parallel genetic algorithm is discussed. The method is directly applicable to the optimization of configurations of FPGA ...
详细信息
ISBN:
(纸本)078036290X
In this paper a methodology for finding the maximal common subgraph of two directed graphs with parallel genetic algorithm is discussed. The method is directly applicable to the optimization of configurations of FPGA (Field Programmable Gate Array) circuits in Run-Time Reconfigurable systems. The problem of finding the maximal common subgraph is known to be NP-complete. The advantage of our approach is that we find optimal or near-optimal solutions in polynomial time using a geneticalgorithm. Since the cost function of the optimization task is multimodal, an implementation of parallel genetic algorithm assures significant improvments of the results.
作者:
Golub, MJakobovic, DUniv Zagreb
Fac Elect Engn & Comp Dept Elect Microelect Comp & Intelligent Syst Zagreb 10000 Croatia
In this paper we describe a multithreaded parallel genetic algorithm (PGA) implementation. Considering the basic models of parallel genetic algorithms, we identify, a variant of global PGA (GPGA) as the most appropria...
详细信息
ISBN:
(纸本)9539676916
In this paper we describe a multithreaded parallel genetic algorithm (PGA) implementation. Considering the basic models of parallel genetic algorithms, we identify, a variant of global PGA (GPGA) as the most appropriate one for use on a microprocessor system with few processors. The difference between the synchronous and asynchronous model is analized and their characteristics are evaluated. Unlike some authors, we choose not to allow a single individual to be engaged in a tournament competition in more than orle instance (no duplicates). The probability of selection for elimination of an individual is than determined based on the fitness of the chromosome and compared with the same probability of the duplicate-allowing algorithm. Finally, main advantages and disadvantages of our GPGA as well as performance comparison with sequential GA are stated.
暂无评论