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

2nd International Conference on Pervasice Computing and Applications

作者： Liu, Feng Chen, Xi Huang, Zhen Anhui Univ Minist Educ Key Lab Intelligent Comp & Signal Proc Hefei 230039 Peoples R China

In this paper, a parallel genetic algorithm for finding all roots of complex functional equation based on parallel Virtual Machine (PVM) is present, research are made in some technical problems for realizing. We descr... 详细信息

ISBN: (纸本)9781424409709

关键词： parallel virtual machine parallel genetic algorithm root complex functional equation

来源：评论

学校读者我要写书评

暂无评论

parallel genetic algorithm with Elite and Diverse Cores for Solving the Minimum Connected Dominating Set Problem in Wireless Networks Topology Control 18

Parallel Genetic Algorithm with Elite and Diverse Cores for ...

引用

2nd International Conference on Future Networks and Distributed Systems (ICFNDS)

作者： Hedar, Abdel-Rahman El-Sayed, Gamal A. Dept Comp Sci Jamoum Mecca 25371 Saudi Arabia Assiut Univ Dept Comp Sci Assiut 71526 Egypt Assiut Univ Dept Elect Engn Assiut 71516 Egypt

ISBN: (纸本)9781450364287

Finding an efficient communication structure among wireless network access points and wireless sensor nodes is essential in optimizing energy consumption and minimizing broadcast latency. Wireless networks Can control their nodes for efficient resource utilization via Topology Control. A topology control based on obtaining Minimum Connected Dominating Set (MCDS) is an efficient approach for constructing wireless network virtual backbone. A virtual backbone reduces energy consumption, reduce communication interference, reduce routing latency, and increase the bandwidth. We propose a new parallel genetic algorithm with elite and diverse cores for constructing wireless network virtual backbone based on finding MCDS of wireless nodes to be used in wireless network topology control. There are predefined number parallel workers, an elite core and a diverse core. All parallel components run genetic operators, and the elite core selects elite solutions among processed sub-population. On the other hand, diverse core looks for new solutions upon receiving elite solution in addition to received processed sub-population. Experimental results show that this algorithm gives better results compared to other methods, particularly for high dimension graph, which is the case in wireless sensor networks. Actually, using parallelism and featured elite and diverse search could help the proposed method to achieve 100% better results compared to its predecessor versions of sequential genetic algorithms. In addition to that, the algorithm is very stable as each result match the average result.

关键词： parallel genetic algorithm minimum connected dominating sets wireless networks network topology control

来源：评论

学校读者我要写书评

暂无评论

parallel genetic algorithm based adaptive thresholding for image segmentation under uneven lighting conditions

Parallel Genetic Algorithm based adaptive thresholding for i...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Kanungo, P. Nanda, P. K. Ghosh, A. CV Raman Coll Engn Dept E&TC IACV Lab Bhubaneswar 752054 Orissa India Siksha O Anusandhan Univ ITER Dept Elect Commun Bhubaneswar 751030 Orissa India Indian Stat Inst Ctr Soft Comp Res Kolkata 700108 India

ISBN: (纸本)9781424465880

In this paper, two adaptive thresholding schemes have been proposed. These two schemes are based on adaptive selection of windows based on the proposed window merging and window growing. Windows are selected based on the entropy and feature entropy criterion. PGA and MMSE based segmentation schemes have been proposed to segment the windows selected a priori. The efficacy of the proposed approaches have been compared with the Huang's pyramidal window merging approach. It is found that the proposed approaches exhibited improved performance in the context of accuracy of segmentation.

关键词： Image Segmentation parallel genetic algorithm Clustering Adaptive Thresholding Entropy

来源：评论

学校读者我要写书评

暂无评论

parallel genetic algorithm based on thread-level speculation

Parallel genetic algorithm based on thread-level speculation

引用

International Conference on Audio, Language and Image Processing

作者： Zhao, Wen-Jiang Yang, Hong-Bin Wu, Yue School of Computer Engineering Science Shanghai University Shanghai 200072 China

ISBN: (纸本)9781424458653

An improved method of classic genetic algorithms is proposed which uses Thread-Level Speculation (TLS) technology for the shortcoming that classic genetic algorithm's search speed is slow. Unlike the classic genetic algorithm, Firstly we replace an individual with a single thread, use TLS technology to process each thread parallel, in order to eliminate the correlation among threads, increase individual diversity in the population, thus accelerate the convergence speed of genetic algorithms. Experimental results demonstrate that the method can increase the individual diversity in the population and accelerate the convergence speed of genetic algorithms, compared with the classic genetic algorithms. ©2010 IEEE.

关键词： convergence convergence speed genetic algorithms parallel genetic algorithm parallel programming thread-level speculation

来源：评论

学校读者我要写书评

暂无评论

A parallel genetic algorithm Based on Spark for Pairwise Test Suite Generation

引用

Journal of Computer Science & Technology 2016年第2期31卷 417-427页

作者： Rong-Zhi Qi Zhi-Jian Wang Shui-Yan Li College of Computer and Information Hohai University Nanjing 211106 China CoUege of Science Hohai University Nanjing 211106 China

Pairwise testing is an effective test generation technique that requires all pairs of parameter values to be by at least one test case. It has been proven that generating minimum test suite is an NP-complete problem covered genetic algorithms have been used for pairwise test suite generation by researchers. However, it is always a time-consuming process, which leads to significant limitations and obstacles for practical use of genetic algorithms towards large-scale test problems. parallelism will be an effective way to not only enhance the computation performance but also improve the quality of the solutions. In this paper, we use Spark, a fast and general parallel computing platform, to parallelize the genetic algorithm to tackle the problem. We propose a two-phase parallelization algorithm including fitness evaluation parallelization and genetic operation parallelization. Experimental results show that our algorithm outperforms the sequential genetic algorithm and competes with other approaches in both test suite size and computational performance. As a result, our algorithm is a promising improvement of the genetic algorithm for pairwise test suite generation.

关键词： pairwise testing parallel genetic algorithm Spark test generation

来源：评论

学校读者我要写书评

暂无评论

Reliability redundancy allocation problem considering optimal redundancy strategy using parallel genetic algorithm

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2017年第Mar.期159卷 153-160页

作者： Kim, Heungseob Kim, Pansoo Korea Air Force Acad Dept Syst Engn 635 Danjae Ro Cheongju South Korea Kyungpook Natl Univ Sch Business Adm 80 Daehak Ro Daegu South Korea

To maximize the reliability of a system, the traditional reliability redundancy allocation problem (RRAP) determines the component reliability and level of redundancy for each subsystem. This paper proposes an advanced RRAP that also considers the optimal redundancy strategy, either active or cold standby. In addition, new examples are presented for it. Furthermore, the exact reliability function for a cold standby redundant subsystem with an imperfect detector/switch is suggested, and is expected to replace the previous approximating model that has been used in most related studies. A parallel genetic algorithm for solving the RRAP as a mixed-integer nonlinear programming model is presented, and its performance is compared with those of previous studies by using numerical examples on three benchmark problems.

关键词： Reliability optimization Reliability redundancy allocation problem parallel genetic algorithm Redundancy strategy Imperfect switching

来源：评论

学校读者我要写书评

暂无评论

Chaotic migration-based pseudo parallel genetic algorithm and its application in inventory optimization

引用

Journal of Systems Engineering and Electronics 2005年第2期16卷 411-417页

作者： ChenXiaofang GuiWeihua WangYalin SchoolofInformationScience&Engineering CentralSouthUniversityChangsha410083P.R.China

Considering premature convergence in the searching process of genetic algorithm, a chaotic migration-based pseudo parallel genetic algorithm (CMPPGA) is proposed, which applies the idea of isolated evolution and information exchanging in distributed parallel genetic algorithm by serial program structure to solve optimization problem of low real-time demand. In this algorithm, asynchronic migration of individuals during parallel evolution is guided by a chaotic migration sequence. Information exchanging among sub-populations is ensured to be efficient and sufficient due to that the sequence is ergodic and stochastic. Simulation study of CMPPGA shows its strong global search ability, superiority to standard genetic algorithm and high immunity against premature convergence. According to the practice of raw material supply, an inventory programming model is set up and solved by CMPPGA with satisfactory results returned.

关键词： parallel genetic algorithm chaos premature convergence inventory optimization.

来源：评论

学校读者我要写书评

暂无评论

A hybrid parallel genetic algorithm for yard crane scheduling

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2010年第1期46卷 136-155页

作者： He, Junliang Chang, Daofang Mi, Weijian Yan, Wei Shanghai Maritime Univ Minist Educ Container Supply Chain Technol Engn Res Ctr Shanghai 200135 Peoples R China Shanghai Jiao Tong Univ Sch Mech Engn Shanghai 200030 Peoples R China Shanghai Maritime Univ Sch Logist Engn Shanghai 200135 Peoples R China

This paper aims at postulating a novel strategy in terms of yard crane scheduling. In this study, a dynamic scheduling model using objective programming for yard cranes is initially developed based on rolling-horizon approach. To resolve the NP-complete problem regarding the yard crane scheduling, a hybrid algorithm, which employs heuristic rules and parallel genetic algorithm (PGA), is then employed. Then a simulation model is developed for evaluating this approach. Finally, numerical experiments on a specific container terminal yard are used for system illustration. Computational results suggest that the proposed method is able to solve the problem efficiently. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Yard crane scheduling Objective programming Heuristic rules parallel genetic algorithm Simulation model

来源：评论

学校读者我要写书评

暂无评论

The parallel genetic algorithm for electromagnetic inverse scattering of a conductor

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2002年第5期79卷 573-586页

作者： Fan, Y Jiang, T Evans, DJ Nottingham Trent Univ Dept Comp Nottingham NG1 4BU England Chinese Acad Sci Inst Automat Natl Lab Pattern Recognit Beijing 100080 Peoples R China

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.

关键词： inverse scattering parallel genetic algorithm moment method and cubic spline

来源：评论

学校读者我要写书评

暂无评论

Solving the dynamic energy aware job shop scheduling problem with the heterogeneous parallel genetic algorithm

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2020年 108卷 119-134页

作者： Luo, Jia El Baz, Didier Xue, Rui Hu, Jinglu Beijing Univ Technol Coll Econ & Management Beijing Peoples R China Univ Toulouse CNRS LAAS Toulouse France Waseda Univ Grad Sch Informat Prod & Syst Kitakyushu Fukuoka Japan Japan Soc Promot Sci Tokyo Japan

Integrating energy savings into production efficiency is considered as one essential factor in modern industrial practice. A lot of research dealing with energy efficiency problems in the manufacturing process focuses solely on building a mathematical model within a static scenario. However, in the physical world shop scheduling problems are dynamic where unexpected events may lead to changes in the original schedule after the start time. This paper makes an investigation into minimizing the total tardiness, the total energy cost and the disruption to the original schedule in the job shop with new urgent arrival jobs. Because of the NP hardness of this problem, a dual heterogeneous island parallel genetic algorithm with the event driven strategy is developed. To reach a quick response in the dynamic scenario, the method we propose is made with a two-level parallelization where the lower level is appropriate for concurrent execution within GPUs or a multi-core CPU while codes from the two sides can be executed simultaneously at the upper level. In the end, numerical tests are implemented and display that the proposed approach can solve the problem efficiently. Meanwhile, the average results have been improved with a significant execution time decrease. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Job shop scheduling Energy efficiency Dynamic scheduling parallel genetic algorithm Multi-core processing GPU computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：