登录
首页 » Java » GA-master

GA-master

于 2018-05-28 发布 文件大小:13KB
0 153
下载积分: 1 下载次数: 0

代码说明:

  遗传算法java代码实现,遗传算法(Genetic Algorithm)是模拟达尔文生物进化论的自然选择和遗传学机理的生物进化过程的计算模型,是一种通过模拟自然进化过程搜索最优解的方法(GeneticAlgorithm,download from github)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • unicode-convert-tools
    unicode转换工具,可把原码转化为html unicode,java unicode以及unicode码(unicode conversion tool, you can put the original code into the html unicode, java unicode and unicode code)
    2013-12-11 09:04:01下载
    积分:1
  • GenericURI
    Implementation of the URI class. This relies on the 1.4 URI class.
    2013-12-06 14:48:38下载
    积分:1
  • Java-P2P-Unleashed
    Java P2P技术内幕.pdf JXTA P2P(java p2p JXTA)
    2012-04-16 12:44:53下载
    积分:1
  • BUS
    公交查询系统 Android studio(Bus search system can used by Android studio)
    2019-01-11 17:08:28下载
    积分:1
  • JAVA
    使用java语言通过反射创新类的新对象,实现功能(Using java language class through reflection innovative new objects, to achieve functional)
    2013-06-09 10:30:56下载
    积分:1
  • XWeb
    jxta应用的一个范例(an example of JXTA applications)
    2004-06-10 16:56:08下载
    积分:1
  • jfreechart-1.0.3
    jfreechart的官方源码,他的强大只有用过的人才知道,供大家学习(jfreechart official source, only used his powerful talent to know, for them to learn)
    2013-01-05 22:40:09下载
    积分:1
  • Eclipse
    多语言程序设计环境Eclipse学习教程,较多用于Java开发。(Multi-language programming environment Eclipse tutorials, mostly used for Java development.)
    2013-12-13 01:07:25下载
    积分:1
  • AIWordSplit
    直接运行compile.bat和run.bat即可 使用了3种分词方法: 1.正向最大匹配(ForwardMatch.java) 2.逆向最大匹配(ForwardMatch.java) 3.最大频率匹配(FrequencyMatch.java)(默认) 取频率最高的词,然后两端递归,构建二杈树存储句子中的词语,显示的时候使用中序遍历二杈树 由于极有可能单个字的使用频率比整个词还高,筛选的时候进行了处理 若单个字不处于当前句子开头,先忽略, 若单个的字处在开头,临时mostFrequency仍为0,且单词长度为1,则加入到二杈树中(Can be run directly compile.bat and run.bat used three kinds of segmentation methods: 1. Being the biggest match (ForwardMatch.java) 2. Reverse maximum matching (ForwardMatch.java) 3. Maximum frequency matching (FrequencyMatch.java) ( default) to take the highest frequency words, and then both ends of the recursive construct two Cha tree storage sentence terms, when used in the sequence shows two Cha tree traversal is very likely because the use of a single word frequency is higher than the whole word, screening If the time were dealing with a single word is not in the beginning of the current sentence, first ignored, if a single word at the beginning of the temporary mostFrequency still 0, and the word length of 1, to 2 Cha tree)
    2010-05-28 10:23:21下载
    积分:1
  • 2
    说明:  关于Java的一个小程序!他是我平时编的,希望对大家有用,谢谢!(On a small Java program!)
    2010-05-29 08:29:01下载
    积分:1
  • 696518资源总数
  • 105678会员总数
  • 22今日下载