检索结果-内蒙古大学图书馆

Pacific-Asia Conference on Knowledge Engineering and Software Engineering

作者： Li, Jianjun Wang, Meng Guangxi Univ Technol Lushan Coll Liuzhou Peoples R China Guangxi Univ Technol Dept Comp Engn Liuzhou Peoples R China

ISBN: (纸本)9783642253485;9783642253492

The aim of test paper composing is to compose an optimization test paper that satisfies the parameters which the user inputs, so the test paper composing problem is a classical multi-objective linear programming problem. This paper proposes an intelligent algorithm to generating test paper based on parallel genetic algorithm, and provides a set of schemes of making papers of different degree of difficulties display in normal distribution. The algorithm adopts a new decimal system of subsection code, improves the traditional method of initializing the population and optimizes course of search. The experiment proves that this algorithm has better performance thus is more practical.

关键词： parallel genetic algorithm artificial intelligence Intelligent Generating Paper

来源：评论

学校读者我要写书评

暂无评论

Model Development for Lattice Properties of Gallium Arsenide using parallel genetic algorithm

Model Development for Lattice Properties of Gallium Arsenide...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Salmani-Jelodar, Mehdi Steiger, Sebastian Paul, Abhijeet Klimeck, Gerhard Purdue Univ Sch Elect & Comp Engn Network Computat Nanotechnol W Lafayette IN 47906 USA

ISBN: (纸本)9781424478354

In the last few years, evolutionary computing (EC) approaches have been successfully used for many real world optimization applications in scientific and engineering areas. One of these areas is computational nanoscience. Semi-empirical models with physics-based symmetries and properties can be developed by using EC to reproduce theoretically the experimental data. One of these semi-empirical models is the Valence Force Field (VFF) method for lattice properties. An accurate understanding of lattice properties provides a stepping stone for the investigation of thermal phenomena and has large impact in thermoelectricity and nano-scale electronic device design. The VFF method allows for the calculation of static properties like the elastic constants as well as dynamic properties like the sound velocity and the phonon dispersion. In this paper a parallel genetic algorithm (PGA) is employed to develop the optimal VFF model parameters for gallium arsenide (GaAs). This methodology can also be used for other semiconductors. The achieved results agree qualitatively and quantitatively with the experimental data.

关键词： gallium arsenide GaAs phonon dispersion elastic constants sound velocity parallel genetic algorithm valence force field model

来源：评论

学校读者我要写书评

暂无评论

A Performance evaluation of a Probabilistic parallel genetic algorithm: FPGA vs. Multi-core Processor

A Performance evaluation of a Probabilistic Parallel Genetic...

引用

17th International Computer Science and Engineering Conference (ICSEC)

作者： Jewajinda, Yutana National Electronics and Computer Technology Center|c|

ISBN: (纸本)9781467353229

This paper presents a performance evaluation between hardware and software implementation of a probabilistic parallel genetic algorithm. The compact genetic algorithm is extended to support parallel implementation. The parallelized compact genetic algorithm is implemented in FPGA hardware and parallelized software version running on multi-core processors for performance evaluation using standard benchmark functions. The experimental results show that the hardware implementation of the parallel compact genetic algorithm delivers speedup of between 100-fold to 500-fold depending on problems size and number of generations.

关键词： parallel genetic algorithm FPGA Multi-core processor

来源：评论

学校读者我要写书评

暂无评论

An investigation into berth allocation and quay crane assignment based on hybrid parallel genetic algorithm

An investigation into berth allocation and quay crane assign...

引用

International Conference on Artificial Intelligence and Computational Intelligence

作者： He, Junliang Mi, Weijian Chang, Daofang Yan, Wei Shanghai Maritime Univ Logist Engn Sch Shanghai 200135 Peoples R China Shanghai Jiao Tong Univ Sch Mech Engn Shanghai 200130 Peoples R China

ISBN: (纸本)9780769538167

A rolling-horizon approach was proposed, which aims at the problem of berth allocation and quay crane assignment. Then a dynamic allocation model using objective programming was initially developed for berths allocation and quay crane assignment, which more closes realistic as result of basing continuum quayside. The model objective function was subject to the minimization of the total berthing location deviation, the total penalty and the energy consumption of quay cranes. Then, a hybrid parallel genetic algorithm (HPGA) was employed for solving the model, which combines parallel genetic algorithm (PGA) and heuristic algorithm. Furthermore, a simulation model integrating HPGA was developed for evaluating this HPGA and executing gene repair techniques to repair the unfeasible individuals generated by HPGA. Finally, case study on a specific container terminal was used for system illustration, and then verified the validity and usefulness of this model and algorithm.

关键词： berth allocation quay crane assignment objective programming rolling-horizon technique heuristic algorithm parallel genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Enhancement of Coarse-Grained parallel genetic algorithm for shortest path Routing

Enhancement of Coarse-Grained Parallel Genetic Algorithm for...

引用

4th International Conference on Computing, Communications and Networking Technologies (ICCCNT)

作者： Venkatesan, L. Sivakumar, P. SKP Engn Coll Dept EEE Tiruvannamalai Tamil Nadu India SKP Engn Coll Dept ECE Tiruvannamalai Tamil Nadu India

ISBN: (纸本)9781479939251

In general efficient way of routing method is used to transfer the data. This routing problem is solved by using Different types of routing algorithms, here we use Coarse-Grained parallel GA-Based shortest path algorithm. Time computation is the vital parameter in all routing methods. The very shortest path routing algorithm involves reduce time of the transferring data. Using genetic algorithm we can find an efficient path. This algorithm found by using the nature of the genetic operation. genetic algorithm is used to change the genes from one sub-population to another sub-population in a proper manner. In this paper discussion is going through both simple genetic algorithm and parallel genetic algorithm and compares performance of both. Here Migration strategy is used to replace the genes. There are four types of strategies that are used to change the genes. These are: Best replace Worst, Best replace Random, Random replace Random, Random replace Worst, Random replace Random. Among these four types of Strategies worst replace best gives the better performance.

关键词： Simple genetic algorithm parallel genetic algorithm Shortest Path routing Gene's crossover

来源：评论

学校读者我要写书评

暂无评论

The Analysis and Research of parallel genetic algorithm

The Analysis and Research of Parallel Genetic Algorithm

引用

4th International Conference on Wireless Communications, Networking and Mobile Computing

作者： Xue Shengjun Guo Shaoyong Bai Dongling Nanjing Univ Informat Sci & Technol Comp & Software Inst Nanjing Peoples R China Wuhan Univ Technol Sch Comp Sci & Technol Wuhan Peoples R China

ISBN: (纸本)9781424421077

With the application of the genetic algorithm (GA) deeply developed, the research of parallel genetic algorithm (PGA) and its realization become very important. Because of PGA inner parallel mechanism, its parallel process becomes a very naturally resolvable method. In this paper, four kinds of parallel models of parallel genetic algorithms, such as master-slave model, coarse-grained model, fine-grained model and mixed model, are simply generalized and evaluated. For every model, its characteristics are displayed. As for the existing problem to each model, the concerning parameters are illustrated in order to improve them. Then some main evaluation models of parallel genetic algorithms are presented. At the end, it is shown that parallel genetic algorithms should go on further study in the future.

关键词： genetic algorithm parallel genetic algorithm mixed model evaluation

来源：评论

学校读者我要写书评

暂无评论

A Improved parallel genetic algorithm Based on Fixed Point Theory for the Optimal Design of Multi-body Model Vehicle Suspensions

A Improved Parallel Genetic Algorithm Based on Fixed Point T...

引用

2nd IEEE International Conference on Computer Science and Information Technology

作者： Liu, Guangyuan Zhang, Jingjun Gao, Ruizhen Sun, Yang Hebei Univ Engn Sci Res Off Handan Peoples R China Hebei Univ Engn Coll Elect & Informat Engn Handan Peoples R China

ISBN: (纸本)9781424445189

Based on an improved genetic algorithm, a parallel genetic algorithm is presented and the skeleton implementing is constituted in this paper. The van der Laan-Talman algorithm is introduced to the genetic algorithm to design convergence criteria objectively and to solve the convergence problem in the later period. The parallel genetic algorithm of multi-body model vehicle suspension optimization is implemented through establishing the interface between ADAMS software and the genetic algorithm. The results show that the parallel genetic algorithm developed in this paper is efficient.

关键词： Vehicle suspension genetic algorithm parallel genetic algorithm Fixed Point Theory Cluster system

来源：评论

学校读者我要写书评

暂无评论

Integration of parallel genetic algorithm and Q-learning for QoS-aware Web Service Composition 12

Integration of Parallel Genetic Algorithm and Q-learning for...

引用

12th International Conference on Computer Engineering and Systems (ICCES)

作者： Elsayed, Doaa H. Gheith, Mervat H. Nasr, Eman S. El Ghazali, Alaa El Din M. Cairo Univ ISSR Dept Informat Syst Technol Cairo Egypt Cairo Univ ISSR Dept Comp Sci Cairo Egypt Sadat Acad Management Sci Dept Comp & Informat Syst Cairo Egypt

ISBN: (纸本)9781538611913

Web Service Composition (WSC) is the process of reusing atomic Web services and combining them together to satisfy users' requirements. The main objective of WSC is to develop composite services to satisfy the Functional Requirements (FR), as well as optimizing the Quality of Services (QoS) requirements. This has led to the emergence of QoS-aware WSC. Due to the increase in number of Web services with the same functionality but various QoS, it became difficult to find the optimal solution in QoS-aware WSC in a given time frame. In this paper we propose a new approach that integrates the use of the parallel genetic algorithm (PGA) and Q-learning to find the optimal WSC within reasonable time. Q-learning is used to generate the initial population to enhance the effectiveness of PGA. PGA is utilized to make the algorithm as time efficient as possible. We implemented our approach *** Framework platform 4.7 using C# programming language. The experiment results show the effectiveness of our proposed approach compared to PGA or GA only.

关键词： quality of services Web service composition parallel genetic algorithm Q-learning

来源：评论

学校读者我要写书评

暂无评论

Optimal Network Hardening Model Based on parallel genetic algorithm

Optimal Network Hardening Model Based on Parallel Genetic Al...

引用

International Conference on Industrial Control and Electronics Engineering (ICICEE)

作者： Ma Jun-chun Sun Ji-yin 402 Staff Second Artillery Engn Inst Xian 710025 Peoples R China

ISBN: (纸本)9780769547923

Because the existed approaches to harden networks have an unavoidable exponential worse-case complexity, and are not scalable to large networks, this paper proposes an optimal network hardening model (ONHM) based on parallel genetic algorithm by combining attack graphs and parallel genetic algorithm. Firstly, we describe the optimal network hardening problem;secondly, we establish a corresponding mathematical model, which converts the optimal network hardening problem to a non-restraint optimization problem with penalty. Through a large number of repeated laboratory tests, the experimental results show ONHM can find the optimal network hardening, and can be applied to large-scale networks.

关键词： network security vulnerability attack graphs optimal network hardening parallel genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A parallel genetic algorithm for cryptanalysis of the polyalphabetic substitution cipher

引用

Cryptologia 1997年第2期21卷 129-138页

作者： Clark, Andrew Dawson, Ed Information Security Research Centre Queensland University of Technology Brisbane QLD 4001 GPO Box 2434 Australia

A new method for attacking the simple substitution cipher is presented which utilises a parallel version of the genetic algorithm. A suitable strategy is devised which allows communication between a number of parallel nodes each solving a separate part of the problem. An analysis of the fitness function is also performed. © 1997, United States Military Academy., All rights reserved.

关键词： Automated cryptanalysis parallel genetic algorithm Substitution cipher

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：