24小时热门版块排行榜    

查看: 4536  |  回复: 96
当前只显示满足指定条件的回帖,点击这里查看本话题的所有回帖

楼1970-01-01 08:00:00
已阅   申请JEPI   回复此楼   编辑   查看我的主页

铁拳虎

至尊木虫 (知名作家)


★
liangzi785(金币+1): 谢谢参与
Accession number:       
20144700227464
        Title:        An evolutionary approach to Tower of Hanoi problem
        Authors:        Li, Jie1 Email author jie_yi_ehw@163.com; Shen, Rui1
        Author affiliation:        1 Department of Computer Engineering, Shandong Aerospace Electro-Technology Institute, Yantai, China
        Corresponding author:        Li, Jie
        Source title:        Advances in Intelligent Systems and Computing
        Abbreviated source title:        Adv. Intell. Sys. Comput.
        Volume:        329
        Volume title:        Genetic and Evolutionary Computing - Proceeding of the Eighth International Conference on Genetic and Evolutionary
        Part number:        1 of 1
        Issue date:        2015
        Publication year:        2015
        Pages:        89-98
        Language:        English
        ISSN:        21945357
        ISBN-13:        9783319122854
        Document type:        Conference article (CA)
        Conference name:        8th International Conference on Genetic and Evolutionary Computing, ICGEC 2014
        Conference date:        October 18, 2014 - October 20, 2014
        Conference location:        Nanchang, China
        Conference code:        110329
        Sponsor:        Nanchang Institute of Technology; National Kaohsiung University of Applied Sciences(Taiwan); Springer; VSB-Technical University of Ostrava (Czech Republic)
        Publisher:        Springer Verlag
        Abstract:        The Tower of Hanoi problem is an ancient and interesting topic. In this paper, we presented an evolutionary algorithm approach for searching the solutions of the problem. We use a direct encoding and apply mutation only in the evolution. Experimental results are reported and show that the proposed method is capable of finding solutions for the problem of multiple pegs. © Springer International Publishing Switzerland 2015.
        Number of references:        16
        Main heading:        Intelligent systems
        Uncontrolled terms:        Direct encoding  -  Evolutionary approach  -  Finding solutions  -  Multiple pegs problem  -  Tower of Hanoi
        Classification code:        723.4 Artificial Intelligence
        DOI:        10.1007/978-3-319-12286-1_10
        Database:        Compendex
                Compilation and indexing terms, © 2015 Elsevier Inc.
18楼2015-08-18 22:50:23
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
查看全部 97 个回答

penghuabei

铁杆木虫 (职业作家)


★
liangzi785(金币+1): 谢谢参与
1236

[ 发自手机版 https://muchong.com/3g ]
9楼2015-08-18 22:50:00
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

jiaaniu

铁杆木虫 (职业作家)


10楼2015-08-18 22:50:03
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

xxh1985

新虫 (正式写手)


★
liangzi785(金币+1): 谢谢参与
祝贺

[ 发自手机版 https://muchong.com/3g ]
11楼2015-08-18 22:50:05
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
简单回复
fatewu2楼
2015-08-18 22:49   回复  
liangzi785(金币+1): 谢谢参与
~ [ 发自小木虫客户端 ]
zgyhit3楼
2015-08-18 22:49   回复  
liangzi785(金币+1): 谢谢参与
恭喜恭喜 [ 发自小木虫客户端 ]
hyypyp6楼
2015-08-18 22:49   回复  
liangzi785(金币+1): 谢谢参与
好 [ 发自小木虫客户端 ]
numerical12楼
2015-08-18 22:50   回复  
liangzi785(金币+1): 谢谢参与
:-D [ 发自手机版 https://muchong.com/3g ]
普通表情 龙 兔 虎 猫 高级回复 (可上传附件)
最具人气热帖推荐 [查看全部] 作者 回/看 最后发表
[硕博家园] 售SCI-T0P文章,我:8O.5.5.1.O.54,科目齐全,可+急 +6 Z7qfCsdIiD1T 2026-11-10 9/450 2026-11-17 08:38 by Equinoxhua
[考研] 售SCI一区T0P文章,我:8.O.55.1.O.5.4,科目全,可+急 +5 Z7qfCsdIiD1T 2026-11-11 6/300 2026-11-17 08:35 by Equinoxhua
[考研] 售SCI一区T0P文章,我:8O.55.1.O.54,科目全,可伽急 +4 uKOSCocCb6Fm 2026-11-13 4/200 2026-11-16 10:11 by K7HMGGdOpylw
[论文投稿] 售SCI一区T0P文章,我:8O.55.1.O.5.4,科目齐全,可+急 +4 SX5mJmPWDfOO 2026-11-13 4/200 2026-11-15 07:45 by xSrQNSSjcgoX
[考研] 售SCI一区文章,我:8O5.5.1.O5.4,科目全,可伽急 +5 G2rhSvqvhNzl 2026-11-10 7/350 2026-11-14 21:58 by Equinoxhua
[教师之家] 售SCI一区T0P文章,我:8.O.55.1.O.5.4,科目全,可+急 +4 1Nb0IVlmV6v0 2026-11-11 4/200 2026-11-13 11:18 by Equinoxhua
[论文投稿] 售SCI一区T0P文章,我:8.O.55.1.O.5.4,科目全,可+急 +4 gRND4NVAZ8VG 2026-11-11 5/250 2026-11-13 11:15 by Equinoxhua
[基金申请] 售SCI一区T0P文章,我:8O.55.1.O.54,科目全,可伽急 +6 C6CRn66RYYXS 2026-11-10 7/350 2026-11-13 10:55 by Equinoxhua
[公派出国] 售SCI一区文章,我:8O5.5.1.O5.4,科目全,可伽急 +3 TgvkbZZl9tqB 2026-11-11 4/200 2026-11-12 12:48 by ECLTXnJnRSXf
[考博] 售一区SCI文章T0P,我:8O.551.O54,科目全,可十急 +4 cdqGD6ftHmbl 2026-11-11 5/250 2026-11-12 12:28 by ECLTXnJnRSXf
[硕博家园] 售SCI一区T0P文章,我:8.O55.1.O.54,科目全,可十急 +4 cdqGD6ftHmbl 2026-11-11 4/200 2026-11-12 12:26 by ECLTXnJnRSXf
[教师之家] 售SCI一区T0P文章,我:8O.55.1.O.54,科目全,可伽急 +4 Z7qfCsdIiD1T 2026-11-10 7/350 2026-11-12 11:22 by HajghKOMynmz
[教师之家] 售SCI-T0P文章,我:8O.5.5.1.O.54,科目齐全,可+急 +4 czAiolzR0IJC 2026-11-10 7/350 2026-11-12 11:00 by HajghKOMynmz
[考研] 售SCI一区T0P文章,我:8.O.55.1.O.5.4,科目全,可+急 +5 C6CRn66RYYXS 2026-11-10 7/350 2026-11-12 10:16 by HajghKOMynmz
[考博] 售SCI一区T0P文章,我:8O.55.1.O.5.4,科目齐全,可+急 +6 YHiw1gou1Eda 2026-11-10 6/300 2026-11-12 10:08 by HajghKOMynmz
[教师之家] 售SCI一区文章,我:8.O.551.O.5.4,科目全,可伽急 +3 TgvkbZZl9tqB 2026-11-11 3/150 2026-11-12 08:26 by HajghKOMynmz
[教师之家] 售SCI一区T0P文章,我:8.O.55.1.O.54,科目齐全,可+急 +3 TgvkbZZl9tqB 2026-11-11 4/200 2026-11-12 08:15 by HajghKOMynmz
[考研] 售SCI一区文章,我:8.O.55.1.O.54,科目齐全,可伽急 +3 cdqGD6ftHmbl 2026-11-11 3/150 2026-11-12 07:53 by HajghKOMynmz
[公派出国] 售SCI一区T0P文章,我:8.O55.1.O.54,科目全,可十急 +4 Z7qfCsdIiD1T 2026-11-10 6/300 2026-11-12 07:09 by 9fOTqj074tIg
[考研] 售SCI一区T0P文章,我:8.O.55.1.O.54,科目齐全,可+急 +5 czAiolzR0IJC 2026-11-10 5/250 2026-11-12 06:25 by 9fOTqj074tIg
信息提示
请填处理意见