咨询与建议

限定检索结果

文献类型

  • 11,280 篇 会议
  • 3,561 篇 期刊文献
  • 49 篇 学位论文
  • 37 册 图书
  • 2 篇 资讯

馆藏范围

  • 14,926 篇 电子文献
  • 5 种 纸本馆藏

日期分布

学科分类号

  • 6,527 篇 工学
    • 4,899 篇 计算机科学与技术...
    • 2,710 篇 电气工程
    • 895 篇 控制科学与工程
    • 619 篇 软件工程
    • 438 篇 信息与通信工程
    • 183 篇 机械工程
    • 170 篇 电子科学与技术(可...
    • 136 篇 仪器科学与技术
    • 109 篇 石油与天然气工程
    • 97 篇 土木工程
    • 68 篇 材料科学与工程(可...
    • 64 篇 动力工程及工程热...
    • 60 篇 建筑学
    • 56 篇 交通运输工程
    • 46 篇 生物医学工程(可授...
    • 44 篇 水利工程
    • 40 篇 化学工程与技术
    • 34 篇 力学(可授工学、理...
    • 33 篇 航空宇航科学与技...
    • 33 篇 网络空间安全
  • 1,295 篇 理学
    • 618 篇 生物学
    • 385 篇 数学
    • 175 篇 物理学
    • 102 篇 系统科学
    • 60 篇 化学
    • 47 篇 统计学(可授理学、...
  • 921 篇 管理学
    • 902 篇 管理科学与工程(可...
  • 157 篇 医学
    • 83 篇 临床医学
    • 75 篇 基础医学(可授医学...
  • 93 篇 农学
  • 51 篇 经济学
    • 34 篇 应用经济学
  • 30 篇 教育学
  • 19 篇 文学
  • 18 篇 法学
  • 17 篇 艺术学
  • 5 篇 哲学
  • 5 篇 军事学

主题

  • 14,929 篇 evolutionary com...
  • 2,561 篇 genetic algorith...
  • 2,489 篇 optimization
  • 1,328 篇 algorithm design...
  • 1,199 篇 sociology
  • 1,039 篇 statistics
  • 961 篇 genetic programm...
  • 956 篇 convergence
  • 927 篇 computer science
  • 825 篇 genetic mutation...
  • 798 篇 computational mo...
  • 729 篇 particle swarm o...
  • 700 篇 testing
  • 659 篇 optimization met...
  • 637 篇 neural networks
  • 591 篇 search problems
  • 589 篇 benchmark testin...
  • 506 篇 biological cells
  • 476 篇 heuristic algori...
  • 416 篇 design optimizat...

机构

  • 51 篇 department of el...
  • 36 篇 graduate school ...
  • 35 篇 school of electr...
  • 33 篇 city univ hong k...
  • 30 篇 univ guelph dept...
  • 29 篇 school of comput...
  • 29 篇 school of comput...
  • 28 篇 south china univ...
  • 27 篇 school of comput...
  • 26 篇 southern univ sc...
  • 26 篇 nanyang technol ...
  • 24 篇 school of comput...
  • 23 篇 hong kong polyte...
  • 23 篇 univ birmingham ...
  • 23 篇 mathematics and ...
  • 22 篇 nat select inc l...
  • 21 篇 univ surrey dept...
  • 21 篇 shenzhen univ co...
  • 21 篇 state key labora...
  • 20 篇 michigan state u...

作者

  • 68 篇 daniel ashlock
  • 50 篇 jin yaochu
  • 48 篇 hisao ishibuchi
  • 48 篇 kotaro hirasawa
  • 38 篇 deb kalyanmoy
  • 38 篇 mabu shingo
  • 36 篇 zhan zhi-hui
  • 34 篇 jun zhang
  • 34 篇 qingfu zhang
  • 34 篇 xue bing
  • 33 篇 yao xin
  • 33 篇 lishan kang
  • 29 篇 licheng jiao
  • 28 篇 jinglu hu
  • 28 篇 zhang mengjie
  • 26 篇 zhang xingyi
  • 25 篇 doerr carola
  • 24 篇 tan kay chen
  • 23 篇 shengxiang yang
  • 23 篇 makoto fukumoto

语言

  • 14,669 篇 英文
  • 189 篇 其他
  • 63 篇 中文
  • 3 篇 德文
  • 3 篇 法文
  • 3 篇 日文
  • 2 篇 西班牙文
  • 1 篇 土耳其文
检索条件"主题词=evolutionary computation"
14929 条 记 录,以下是4981-4990 订阅
排序:
Improving CMA-ES by Random Evaluation on the Minor Eigenspace
Improving CMA-ES by Random Evaluation on the Minor Eigenspac...
收藏 引用
2010 IEEE World Congress on computational Intelligence
作者: Au, Chun-Kit Leung, Ho-Fung Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China
This paper proposes a modification to the covariance matrix adaptation evolution strategies (CMA-ES). The goal of our modification is to reduce the number of function evaluations to adapt the covariance matrix to the ... 详细信息
来源: 评论
A No-Free-Lunch theorem for non-uniform distributions of target functions
收藏 引用
Journal of Mathematical Modelling and Algorithms 2004年 第4期3卷 313-322页
作者: Igel, Christian Toussaint, Marc Department of Theoretical Biology Institut für Neuroinformatik Ruhr-Universität Bochum 44780 Bochum Germany
The sharpened No-Free-Lunch-theorem (NFL-theorem) states that, regardless of the performance measure, the performance of all optimization algorithms averaged uniformly over any finite set F of functions is equal if an... 详细信息
来源: 评论
Optimizing Player Behavior In A Real-Time Strategy Game Using evolutionary Algorithms
Optimizing Player Behavior In A Real-Time Strategy Game Usin...
收藏 引用
IEEE Congress on evolutionary computation (CEC)
作者: Fernandez-Ares, A. Mora, A. M. Merelo, J. J. Garcia-Sanchez, P. Fernandes, C. Univ Granada Dept Arquitectura & Tecnol Comp E-18071 Granada Spain
This paper describes an evolutionary Algorithm for evolving the decision engine of a bot designed to play the Planet Wars game. This game, which has been chosen for the Google Artificial Intelligence Challenge in 2010... 详细信息
来源: 评论
Dynamic behaviour forecast as a driving force in the coevolution of one-dimensional cellular automata  7
Dynamic behaviour forecast as a driving force in the coevolu...
收藏 引用
7th Brazilian Symposium on Neural Networks (SBRN 02)
作者: Oliveira, GMB Asakura, OKN de Oliveira, PPB Univ Presbiteriana Mackenzie Posgrad Engn Eletr Sao Paulo Brazil
Various evolutionary methods have been used to look for cellular automata (CA) with a predefined computational behaviour. The most widely studied CA task is the Density Classification Task (DCT) and the best rule curr... 详细信息
来源: 评论
Geometric Semantic Genetic Programming Using External Division of Parents  4
Geometric Semantic Genetic Programming Using External Divisi...
收藏 引用
IIAI 4th International Congress on Advanced Applied Informatics (IIAI-AAI)
作者: Hara, Akira Kushida, Jun-ichi Kisaka, Kei Takahama, Tetsuyuki Hiroshima City Univ Grad Sch Informat Sci Asaminami Ku 3-4-1 Ozuka Higashi Hiroshima 7313194 Japan Hiroshima City Univ Fac Informat Sci Hiroshima Japan
In this paper, we focus on symbolic regression problems, in which we find functions approximating the relationships between given input and output data. If we do not have the knowledge on the structure (e.g. degree) o... 详细信息
来源: 评论
Cooperative Co-evolution and Adaptive Team Composition for a Multi-rover Resource Allocation Problem  1
收藏 引用
25th European Conference on Genetic Programming (EuroGP) Held as Part of EvoStar Conference
作者: Fontbonne, Nicolas Maudet, Nicolas Bredeche, Nicolas Sorbonne Univ ISIR CNRS F-75005 Paris France Sorbonne Univ LIP6 F-75005 Paris France
In this paper, we are interested in ad hoc autonomous agent team composition using cooperative co-evolutionary algorithms (CCEA). In order to accurately capture the individual contribution of team agents, we propose t... 详细信息
来源: 评论
Saliency Improvement Through Genetic Programming  18
Saliency Improvement Through Genetic Programming
收藏 引用
3rd International Workshop on Interactive and Spatial Computing (IWISC)
作者: Martinez-Rodriguez, Diana E. Contreras-Cruz, Marco A. Hernandez-Belmonte, Uriel H. Bereg, Sergey Ayala-Ramirez, Victor Univ Guanajuato DICIS Guanajuato Mexico Univ Texas Dallas Richardson TX 75083 USA
Visual saliency detection aims at finding regions of interest which contain relevant information in images. In the last years, several saliency methods have been proposed, however, it is still a challenging task in vi... 详细信息
来源: 评论
Diagnosis of small-signal parameters for broadband amplifiers through S-parameter measurements and sensitivity-guided evolutionary search  04
Diagnosis of small-signal parameters for broadband amplifier...
收藏 引用
International Conference on Computer Aided Design (ICCAD 2004)
作者: Liu, F Ozev, S Brooke, M Duke Univ Durham NC 27708 USA
With increasing uncertainties in the modeling and processing of semiconductor devices, it is essential that the sources of failures be identified once the devices are manufactured In this paper, we present a methodolo... 详细信息
来源: 评论
A Primary Study on Hyper-Heuristics Powered by Artificial Neural Networks for Customising Population-based Metaheuristics in Continuous Optimisation Problems
A Primary Study on Hyper-Heuristics Powered by Artificial Ne...
收藏 引用
IEEE Congress on evolutionary computation (CEC)
作者: Tapia-Avitia, Jose M. Cruz-Duarte, Jorge M. Amaya, Ivan Carlos Ortiz-Bayliss, Jose Terashima-Marin, Hugo Pillay, Nelishia Tecnol Monterrey Monterrey Mexico Univ Pretoria Pretoria South Africa
Metaheuristics (MHs) are proven powerful algorithms for solving non-linear optimisation problems over discrete, continuous, or mixed domains. Applications have ranged from basic sciences to applied technologies. Nowad... 详细信息
来源: 评论
Decomposing Large-Scale Capacitated Arc Routing Problems using a Random Route Grouping Method
Decomposing Large-Scale Capacitated Arc Routing Problems usi...
收藏 引用
IEEE Congress on evolutionary computation
作者: Mei, Yi Li, Xiaodong Yao, Xin RMIT Univ Sch Comp Sci & Informat Technol Melbourne Vic 3000 Australia Univ Birmingham Sch Comp Sci Birmingham B15 2TT W Midlands England
In this paper, a simple but effective Random Route Grouping (RRG) scheme is developed to decompose the Large-Scale Capacitated Arc Routing Problem (LSCARP). A theoretical analysis is given to show that the decompositi... 详细信息
来源: 评论