咨询与建议

限定检索结果

文献类型

  • 2,236 篇 期刊文献
  • 1,750 篇 会议
  • 19 篇 学位论文
  • 1 册 图书

馆藏范围

  • 4,006 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 3,669 篇 工学
    • 2,085 篇 计算机科学与技术...
    • 1,445 篇 软件工程
    • 742 篇 电气工程
    • 613 篇 控制科学与工程
    • 333 篇 机械工程
    • 327 篇 信息与通信工程
    • 155 篇 动力工程及工程热...
    • 149 篇 石油与天然气工程
    • 129 篇 电子科学与技术(可...
    • 129 篇 土木工程
    • 92 篇 材料科学与工程(可...
    • 89 篇 仪器科学与技术
    • 75 篇 环境科学与工程(可...
    • 73 篇 交通运输工程
    • 69 篇 力学(可授工学、理...
    • 65 篇 建筑学
    • 61 篇 化学工程与技术
    • 57 篇 水利工程
    • 55 篇 航空宇航科学与技...
    • 47 篇 生物医学工程(可授...
  • 1,874 篇 理学
    • 1,443 篇 数学
    • 229 篇 系统科学
    • 196 篇 物理学
    • 192 篇 统计学(可授理学、...
    • 68 篇 化学
    • 60 篇 生物学
  • 391 篇 管理学
    • 340 篇 管理科学与工程(可...
    • 72 篇 工商管理
    • 48 篇 图书情报与档案管...
  • 95 篇 医学
  • 54 篇 经济学
    • 51 篇 应用经济学
  • 28 篇 农学
  • 21 篇 法学
  • 16 篇 教育学
  • 9 篇 文学
  • 3 篇 军事学
  • 2 篇 艺术学

主题

  • 4,006 篇 optimization alg...
  • 270 篇 optimization
  • 190 篇 algorithms
  • 98 篇 machine learning
  • 88 篇 design
  • 66 篇 particle swarm o...
  • 55 篇 genetic algorith...
  • 54 篇 optimal control
  • 51 篇 convergence
  • 48 篇 objective functi...
  • 47 篇 genetic algorith...
  • 39 篇 simulation
  • 39 篇 artificial intel...
  • 38 篇 optimal design
  • 38 篇 converge
  • 34 篇 evolutionary alg...
  • 34 篇 heuristic algori...
  • 33 篇 predictive contr...
  • 33 篇 deep learning
  • 32 篇 optimisation

机构

  • 12 篇 duy tan univ ins...
  • 10 篇 national key lab...
  • 8 篇 amman arab univ ...
  • 7 篇 stanford univers...
  • 7 篇 univ technol syd...
  • 7 篇 semnan univ dept...
  • 6 篇 georgia inst tec...
  • 6 篇 department of co...
  • 6 篇 google research ...
  • 6 篇 school of artifi...
  • 5 篇 politecn milan d...
  • 5 篇 tu wien austria
  • 5 篇 ain shams univ f...
  • 5 篇 google deepmind ...
  • 5 篇 school of data s...
  • 5 篇 school of comput...
  • 5 篇 university of mi...
  • 5 篇 ton duc thang un...
  • 4 篇 college of compu...
  • 4 篇 semnan univ fac ...

作者

  • 12 篇 abualigah laith
  • 12 篇 ehteram mohammad
  • 9 篇 gandomi amir h.
  • 9 篇 hasanipanah mahd...
  • 9 篇 notarstefano giu...
  • 9 篇 ishibuchi hisao
  • 8 篇 zhan zhi-hui
  • 8 篇 zhang jun
  • 7 篇 rashid tarik a.
  • 7 篇 ahmed ali najah
  • 7 篇 hasanien hany m.
  • 7 篇 quirynen rien
  • 7 篇 pan jeng-shyang
  • 7 篇 zhang lijun
  • 6 篇 sundaram shreyas
  • 6 篇 neumann frank
  • 6 篇 wang lei
  • 6 篇 zhang lei
  • 6 篇 yang shengxiang
  • 6 篇 wei ermin

语言

  • 3,279 篇 英文
  • 664 篇 其他
  • 52 篇 中文
  • 5 篇 土耳其文
  • 4 篇 斯洛文尼亚文
  • 3 篇 法文
  • 1 篇 德文
  • 1 篇 西班牙文
  • 1 篇 塞尔维亚文
检索条件"主题词=Optimization algorithms"
4006 条 记 录,以下是1321-1330 订阅
排序:
Optimal Linear Combination of Heuristic Strategies for 2D Rectangular Bin Packing algorithms  2
Optimal Linear Combination of Heuristic Strategies for 2D Re...
收藏 引用
2nd IEEE International Conference on Image Processing and Computer Applications, ICIPCA 2024
作者: Huang, Jipan Xiangtan University Xiangtan China
The 2D Bin Packing Problem (2DBPP) is an NP-hard combinatorial optimization problem, where common heuristic algorithms often exhibit characteristics of greedy strategy scoring during the selection of items and the det... 详细信息
来源: 评论
Performance of Beta Mutation on CEC 2017 and CEC 2022 Benchmarks  13
Performance of Beta Mutation on CEC 2017 and CEC 2022 Benchm...
收藏 引用
13th IEEE Congress on Evolutionary Computation, CEC 2024
作者: Kumar, Yogesh Deep, Kusum Indian Institute of Technology Roorkee Department of Mathematics Uttarakhand Roorkee India
Real Coded Genetic algorithms (RCGAs) are pop-ular, versatile, non-traditional optimization techniques and can be applicable to a numerous variety of optimization problems. The performance of RCGAs depends on the choi... 详细信息
来源: 评论
Maximum Letter-Duplicated Subsequence (short paper)  25
Maximum Letter-Duplicated Subsequence (short paper)
收藏 引用
25th Italian Conference on Theoretical Computer Science, ICTCS 2024
作者: Dondi, Riccardo Hosseinzadeh, Mehdi Popa, Alexandru Università degli Studi di Bergamo Bergamo Italy University of Bucharest Romania
In this contribution we consider Max-LL-DUP, an optimization problem that asks for a letter-duplicated subsequence of an input string that contains the maximum number of letters of the alphabet over which the input st... 详细信息
来源: 评论
An Enhanced GJO-Pattern Search Algorithm to Solve the Optimal Power Dispatch Problem
An Enhanced GJO-Pattern Search Algorithm to Solve the Optima...
收藏 引用
2024 International Conference on Sustainable Power and Energy, ICSPE 2024
作者: Kishor, Jugal Sahu, Chandra Kumar Nigam, Manoj Kumar Biswal, Sandeep Yadaw, Praveen Kumar Kumar, Rajendra Kalinga University EE Department New Raipur India OP Jindal University EE Department Raigarh India
A critical optimization job in power system operation is the Optimal Power Dispatch (OPD) problem, which aims to minimize the total generation cost while meeting power demand and system constraints. The complicated, n... 详细信息
来源: 评论
Hybrid Graph Visualizations With ChordLink: algorithms, Experiments, and Applications
收藏 引用
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2022年 第2期28卷 1288-1300页
作者: Angori, Lorenzo Didimo, Walter Montecchiani, Fabrizio Pagliuca, Daniele Tappini, Alessandra Univ Perugia Dipartimento Ingn Via G Duranti I-9306125 Perugia Italy Agenzia Entrate I-52100 Arezzo Italy
Many real-world networks are globally sparse but locally dense. Typical examples are social networks, biological networks, and information networks. This double structural nature makes it difficult to adopt a homogene... 详细信息
来源: 评论
Exploring the Efficacy of Intelligent Water Drops Algorithm for Solving Nondeterministic Polynomial Problems  7
Exploring the Efficacy of Intelligent Water Drops Algorithm ...
收藏 引用
7th International Conference on Internet Applications, Protocols, and Services, NETAPPS 2024
作者: Thalji, Nisrean Jaber Faculty of Computer Studies Arab Open University Amman Jordan
Swarm-based optimization algorithms (SBOAs) have demonstrated effectiveness in solving complex problems within a reasonable time. Among these algorithms, the intelligent water drops algorithm (IWD) has recently gained... 详细信息
来源: 评论
Construction of Financial Investment Risk Control Model Based on Improved Particle Swarm Algorithm
Construction of Financial Investment Risk Control Model Base...
收藏 引用
2024 International Conference on Innovative Design and Intelligent Manufacturing, IDIM 2024
作者: Wu, Jianing Software Engineering Institute of Guangzhou Guangzhou510980 China
In order to solve the problem that the particle swarm algorithm does not have high search ability in the late iteration and the particles tend to fall into the local optimum when it is introduced into a nonlinear fina... 详细信息
来源: 评论
Research on Path Planning Based on Improved Slime Mold Algorithm  4
Research on Path Planning Based on Improved Slime Mold Algor...
收藏 引用
4th International Conference on Electronic Information Engineering and Computer Science, EIECS 2024
作者: Jia, Lishan Xu, Wei College of Electronic Information and Automation Civil Aviation University of China Tianjin China
The basic slime mold algorithm tends to become trapped in local optima during the optimization process, and the convergence rate is slow, so an improved slime mold algorithm is used. Firstly, a low difference sequence... 详细信息
来源: 评论
Comparative Analysis Based on Graph Theory for Network Reconfiguration Considering EV Penetration Level and Consumer Charging Behaviour  22
Comparative Analysis Based on Graph Theory for Network Recon...
收藏 引用
22nd IEEE Student Conference on Research and Development, SCOReD 2024
作者: Fatini, Nur Aina Mohamad, Hasmaini Naidu, Kanendra Sofiuddin, Hafiz Universiti Teknologi MARA College of Engineering Selangor Shah Alam40450 Malaysia
The growing adoption of Electric Vehicles (EVs) poses challenges to distribution networks, such as voltage instability, increased losses, and overload conditions. This study proposes an optimization-based network reco... 详细信息
来源: 评论
On Generalization of ELA Feature Groups
On Generalization of ELA Feature Groups
收藏 引用
2024 Genetic and Evolutionary Computation Conference Companion, GECCO 2024 Companion
作者: Petelin, Gašper Cenikj, Gjorgjina Jozef Stefan International Postgraduate School Computer Systems Department Jožef Stefan Institute Ljubljana Slovenia
Algorithm selection, i.e., selecting the most suitable algorithm for a specific problem, is a vital task in continuous black-box optimization. A popular strategy used to address this task is to characterize optimizati... 详细信息
来源: 评论