虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

Algorithm<b>genetic</b><b>genetic</b>

  • real genetic algorithm matlab code

    real genetic algorithm matlab code

    标签: algorithm genetic matlab real

    上传时间: 2017-09-07

    上传用户:qq1604324866

  • Genetic Algorithm + Neural Network for caracteristic optimization

    Genetic Algorithm + Neural Network for caracteristic optimization

    标签: caracteristic optimization Algorithm Genetic

    上传时间: 2014-01-15

    上传用户:manlian

  • 遗传算法以及其图像分割的应用 Genetic Algorithm

    遗传算法以及其图像分割的应用 Genetic Algorithm

    标签: Algorithm Genetic 算法 图像分割

    上传时间: 2014-01-25

    上传用户:笨小孩

  • 遗传算法经典例子matlab来实现-Matlab genetic algorithm to achieve a classic example of

    遗传算法经典例子matlab来实现-Matlab genetic algorithm to achieve a classic example of

    标签: algorithm genetic achieve classic

    上传时间: 2013-12-26

    上传用户:ztj182002

  • Genetic Algorithm for two variable

    Genetic Algorithm for two variable

    标签: Algorithm variable Genetic for

    上传时间: 2014-01-08

    上传用户:虫虫虫虫虫虫

  • 用C51实现无功补偿中电容组循环投切的算法

    介绍了用单片机C 语言实现无功补偿中电容组循环投切的基本原理和算法,并举例说明。关键词:循环投切;C51;无功补偿中图分类号: TM76 文献标识码: BAbstract: This paper introduces the aplication of C51 in the controlling of capacitorsuits cycle powered to be on and off in reactive compensation.it illustrate thefondamental principle and algorithm with example.Key words: cycle powered to be on and off; C51; reactive compensation 为提高功率因数,往往采用补偿电容的方法来实现。而电容器的容量是由实时功率因数与标准值进行比较来决定的,实时功率因数小于标准值时,需投入电容组,实时功率因数大于标准值时,则需切除电容组。投切方式的不合理,会对电容器造成损坏,现有的控制器多采用“顺序投切”方式,在这种投切方式下排序在前的电容器组,先投后切;而后面的却后投先切。这不仅使处于前面的电容组经常处于运行状态,积累热量不易散失,影响其使用寿命,而且使后面的投切开关经常动作,同样减少寿命。合理的投切方式应为“循环投切”。这种投切方式使先投入的运行的电容组先退出,后投的后切除,从而使各组电容及投切开关使用机率均等,降低了电容组的平均运行温度,减少了投切开关的动作次数,延长了其使用寿命。

    标签: C51 无功补偿 循环 电容

    上传时间: 2014-12-27

    上传用户:hopy

  • 算法ebook(10部算法经典著作的合集) 算法ebook> 10部算法经典著作的合集 chm格式 (1)Fundamentals of Data Structures by Ellis Hor

    算法ebook(10部算法经典著作的合集) 算法ebook> 10部算法经典著作的合集 chm格式 (1)Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni (2)Data Structures, Algorithms and Program Style Using C by James F. Korsh and Leonard J. Garrett (3)Data Structures and Algorithm Analysis in C by Mark Allen Weiss (4)Data Structures: From Arrays to Priority Queues by Wayne Amsbury (5)Information Retrieval: Data Structures & Algorithms edited by William B. Frakes and Ricardo Baeza-Yates (6)Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest (7)Practical Data Structures in C++ by Bryan Flamig (8)Reliable Data Structures in C by Thomas Plum (9)Data Structures and Algorithms Alfred V. Aho, Bell Laboratories, Murray Hill, New Jersey John E. Hopcroft, Cornell University, Ithaca, New York Jeffrey D. Ullman, Stanford University, Stanford, California (10)DDJ Algorithms and Data Structures Articles

    标签: ebook Fundamentals Structures Ellis

    上传时间: 2015-04-04

    上传用户:tfyt

  • Description: FASBIR(Filtered Attribute Subspace based Bagging with Injected Randomness) is a variant

    Description: FASBIR(Filtered Attribute Subspace based Bagging with Injected Randomness) is a variant of Bagging algorithm, whose purpose is to improve accuracy of local learners, such as kNN, through multi-model perturbing ensemble. Reference: Z.-H. Zhou and Y. Yu. Ensembling local learners through multimodal perturbation. IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, 2005, vol.35, no.4, pp.725-735.

    标签: Description Randomness Attribute Filtered

    上传时间: 2015-04-10

    上传用户:ynzfm

  • 十部经典算法合集 .chm Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni PREFACE C

    十部经典算法合集 .chm Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni PREFACE CHAPTER 1: INTRODUCTION CHAPTER 2: ARRAYS CHAPTER 3: STACKS AND QUEUES CHAPTER 4: LINKED LISTS CHAPTER 5: TREES CHAPTER 6: GRAPHS CHAPTER 7: INTERNAL SORTING CHAPTER 8: EXTERNAL SORTING CHAPTER 9: SYMBOL TABLES CHAPTER 10: FILES APPENDIX A: SPARKS APPENDIX B: ETHICAL CODE IN INFORMATION PROCESSING APPENDIX C: ALGORITHM INDEX BY CHAPTER

    标签: Fundamentals Structures Horowitz PREFACE

    上传时间: 2015-05-19

    上传用户:维子哥哥

  • Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search ma

    Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.

    标签: Implemented following compile command

    上传时间: 2014-01-01

    上传用户:lhc9102