设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
SpringerLink电子期刊(11)
Elsevier电子期刊(14)
在“
Elsevier电子期刊
”中,
命中:
14
条,耗时:小于0.01 秒
在所有数据库中总计命中:
25
条
1.
A hybrid discrete optimization algorithm
based
on teaching-probabilistic learning mechanism for no-wait flow shop scheduling
作者:
Weishi Shao
a
;
shaoweishi@hotmail.com" class="auth_mail" title="E-mail the corresponding author
;
Dechang Pi
a
;
b
;
nuaacs@126.com" class="auth_mail" title="E-mail the corresponding author
;
Zhongshi Shao
a
;
shaozhongshi@hotmail.com" class="auth_mail" title="E-mail the corresponding author
关键词:
Discrete teaching
;
Discrete probabilistic learning
;
Population reconstruction
;
Neighborhood search
;
No-wait flow shop scheduling
;
Minimization of makespan
刊名:Knowledge-
Based
Systems
出版年:2016
2.
Hybrid sliding level
Taguchi
-
based
particle swarm optimization for flowshop scheduling problems
作者:
Jinn-Tsong Tsai
;
Ching-I. Yang
;
Jyh-Horng Chou
关键词:
Flowshop scheduling problem
;
Sliding level
Taguchi
-
based
particle swarm optimization
;
Taguchi
-
based
crossover
刊名:Applied Soft Computing Journal
出版年:February, 2014
3.
Optimized weights of document keywords for auto-reply accuracy
作者:
Jinn-Tsong Tsai
关键词:
Keyword weight
;
Auto-reply accuracy
;
e-learning
;
Differential evolution
;
Taguchi
method
刊名:Neurocomputing
出版年:2014
4.
A novel fruit fly optimization algorithm for the semiconductor final testing scheduling problem
作者:
Xiao-long Zheng
;
Ling Wang
;
Sheng-yao Wang
关键词:
Fruit fly optimization algorithm
;
Smell-
based
search
;
Vision-
based
search
;
Cooperative search
;
Semiconductor final testing scheduling problem
刊名:Knowledge-
Based
Systems
出版年:February, 2014
5.
Hybrid
Taguchi
-chaos of multilevel immune and the artificial bee colony algorithm for parameter identification of chaotic systems
作者:
Jia-Ping Tien
;
Tzuu-Hseng S. Li
关键词:
Artificial bee colony algorithm
;
Chaos operation
;
Chaotic systems
;
Immune algorithm
;
Parameter identification
;
Taguchi
method
刊名:Computers and Mathematics with Applications
出版年:2012
6.
Enhancement of Self-adaptive real-coded genetic algorithm using
Taguchi
method for Economic dispatch problem
作者:
P. Subbaraj
;
R. Rengaraj
;
S. Salivahanan
关键词:
Self-adaptive real-coded genetic algorithm
;
Taguchi
method
;
Simulated binary
crossover
;
Polynomial mutation and valve-point loading
刊名:Applied Soft Computing Journal
出版年:2011
7.
Hybrid
Taguchi
-Immune Algorithm for the thermal unit commitment
作者:
Ming-Tang Tsai
a
;
tsaymt@post.csu.edu.tw
;
Hong-Jey Gow
b
;
Whei-Min Lin
c
关键词:
Immune algorithm
;
Unit commitment
;
Taguchi
method
;
Orthogonal arrays
;
Signal-to-noise ratio (SNR)
刊名:International Journal of Electrical Power and Energy Systems
出版年:2011
8.
Enzyme and metabolic engineering for the production of novel biopolymers:
crossover
of biological and chemical processes
作者:
Ken鈥檌chiro Matsumoto
;
Seiichi
Taguchi
刊名:Current Opinion in Biotechnology
出版年:December, 2013
9.
A Directed Genetic Algorithm for global optimization
作者:
Hsin-Chuan Kuo
;
khc@ntou.edu.tw
;
khc@mail.ntou.edu.tw
;
Ching-Hai Lin
;
lch850@gmail.com
关键词:
Directed genetic algorithm
;
Nelder&ndash
;
Mead&rsquo
;
s simplex algorithm
;
Global optimization
刊名:Applied Mathematics and Computation
出版年:2013
10.
An efficient hybrid
Taguchi
-immune algorithm for the unit commitment problem
作者:
Whei-Min Lin
a
;
wmlin@ee.nsysu.edu.tw"" rel=""nofollow
;
Hong-Jey Gow
a
;
ghjey19@yahoo.com.tw"" rel=""nofollow
;
Ming-Tang Tsai
b
;
tsaymt@post.csu.edu.tw"" rel=""nofollow
关键词:
Immune algorithm
;
Unit commitment
;
Taguchi
method
;
Orthogonal arrays
;
Signal-to-noise ratio (
SNR
)
刊名:Expert Systems with Applications
出版年:2011
1
2
按检索点细分(14)
关键词(2)
文摘(12)
按出版年细分(14)
2027年及以后(3)
2016年(1)
2014年(1)
2013年(1)
2012年(1)
2011年(5)
2010年(1)
2008年(1)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.