咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 3,675 篇 工学
    • 2,071 篇 计算机科学与技术...
    • 1,413 篇 软件工程
    • 748 篇 电气工程
    • 627 篇 控制科学与工程
    • 339 篇 机械工程
    • 333 篇 信息与通信工程
    • 158 篇 动力工程及工程热...
    • 153 篇 石油与天然气工程
    • 131 篇 土木工程
    • 129 篇 电子科学与技术(可...
    • 94 篇 材料科学与工程(可...
    • 89 篇 仪器科学与技术
    • 78 篇 环境科学与工程(可...
    • 74 篇 交通运输工程
    • 73 篇 力学(可授工学、理...
    • 66 篇 建筑学
    • 62 篇 化学工程与技术
    • 57 篇 水利工程
    • 56 篇 航空宇航科学与技...
    • 47 篇 生物医学工程(可授...
  • 1,855 篇 理学
    • 1,415 篇 数学
    • 227 篇 系统科学
    • 204 篇 物理学
    • 183 篇 统计学(可授理学、...
    • 69 篇 化学
    • 61 篇 生物学
  • 396 篇 管理学
    • 345 篇 管理科学与工程(可...
    • 70 篇 工商管理
    • 48 篇 图书情报与档案管...
  • 97 篇 医学
  • 54 篇 经济学
    • 51 篇 应用经济学
  • 28 篇 农学
  • 21 篇 法学
  • 15 篇 教育学
  • 9 篇 文学
  • 3 篇 军事学
  • 2 篇 艺术学

主题

  • 4,005 篇 optimization alg...
  • 272 篇 optimization
  • 192 篇 algorithms
  • 102 篇 machine learning
  • 87 篇 design
  • 66 篇 particle swarm o...
  • 55 篇 genetic algorith...
  • 55 篇 optimal control
  • 51 篇 convergence
  • 49 篇 genetic algorith...
  • 48 篇 objective functi...
  • 40 篇 artificial intel...
  • 38 篇 simulation
  • 38 篇 optimal design
  • 38 篇 converge
  • 35 篇 deep learning
  • 34 篇 evolutionary alg...
  • 33 篇 predictive contr...
  • 33 篇 heuristic algori...
  • 32 篇 optimisation

机构

  • 13 篇 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 篇 ton duc thang un...
  • 4 篇 college of compu...
  • 4 篇 semnan univ fac ...
  • 4 篇 college of compu...

作者

  • 12 篇 abualigah laith
  • 12 篇 ehteram mohammad
  • 10 篇 hasanipanah mahd...
  • 10 篇 notarstefano giu...
  • 9 篇 gandomi amir h.
  • 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
  • 7 篇 carnevale guido
  • 6 篇 sundaram shreyas
  • 6 篇 wang lei
  • 6 篇 zhang lei
  • 6 篇 yang shengxiang
  • 6 篇 wei ermin

语言

  • 3,217 篇 英文
  • 728 篇 其他
  • 52 篇 中文
  • 5 篇 斯洛文尼亚文
  • 4 篇 土耳其文
  • 3 篇 法文
  • 1 篇 德文
  • 1 篇 西班牙文
  • 1 篇 塞尔维亚文
检索条件"主题词=Optimization Algorithms"
4005 条 记 录,以下是1451-1460 订阅
Minimum Complete Pareto Front of a Biobjective Minimum Spanning Trees Problem
Minimum Complete Pareto Front of a Biobjective Minimum Spann...
收藏 引用
2024 International Conference Automatics and Informatics, ICAI 2024
作者: Laskov, Lasko Marinov, Marin New Bulgarian University Department of Informatics Sofia Bulgaria
We propose an exact method that finds a minimum complete Pareto front of the biobjective minimum length minimum risk spanning trees problem. The method consists in two algorithms. The first algorithm finds a single mi... 详细信息
来源: 评论
A survey on computation offloading and service placement in fog computing-based IoT
收藏 引用
JOURNAL OF SUPERCOMPUTING 2022年 第2期78卷 1983-2014页
作者: Gasmi, Kaouther Dilek, Selma Tosun, Suleyman Ozdemir, Suat Higher Inst Appl Languages & Comp Sci Beja Tunis Tunisia Hacettepe Univ Grad Sch Sci & Engn Ankara Turkey Hacettepe Univ Dept Comp Engn Ankara Turkey
In recent years, fog computing has emerged as a computing paradigm to support the computationally intensive and latency-critical applications for resource limited Internet of Things (IoT) devices. The main feature of ... 详细信息
来源: 评论
IPG Observer: A Newton-Type Observer Robust to Measurement Noise
IPG Observer: A Newton-Type Observer Robust to Measurement N...
收藏 引用
American Control Conference (ACC)
作者: Chakrabarti, Kushal Chopra, Nikhil Tata Consultancy Serv Res Mumbai 400607 Maharashtra India Univ Maryland College Pk MD 20742 USA
The previously proposed Newton observer for nonlinear systems has fast exponential convergence and applies to a wide class of problems. However, the Newton observer lacks robustness against measurement noise due to th... 详细信息
来源: 评论
A Novel Comprehensive Learning JAYA Algorithm Based on Lévy Flights  28
A Novel Comprehensive Learning JAYA Algorithm Based on Lévy...
收藏 引用
28th International Computer Science and Engineering Conference, ICSEC 2024
作者: Shen, Xintong Sunat, Khamron Khon Kaen University College of Computing Khon Kaen Thailand
To address the issue of the JAYA algorithm becoming stuck in suboptimal solutions, this paper introduces the Lévy flight method and proposes a novel CLJAYA-LF algorithm. This new approach integrates the Lévy... 详细信息
来源: 评论
An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2022年 第6期67卷 2685-2699页
作者: Li, Yunchuan Fu, Michael C. Xu, Jie Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA Univ Maryland Inst Syst Res College Pk MD 20742 USA Univ Maryland RH Smith Sch Business & Inst Syst Res College Pk MD 20742 USA George Mason Univ Dept Syst Engn & Operat Res Fairfax VA 22030 USA
We analyze a tree search problem with an underlying Markov decision process, in which the goal is to identify the best action at the root that achieves the highest cumulative reward. We present a new tree policy that ... 详细信息
来源: 评论
Optimal Acceleration for Minimax and Fixed-Point Problems is Not Unique  41
Optimal Acceleration for Minimax and Fixed-Point Problems is...
收藏 引用
41st International Conference on Machine Learning, ICML 2024
作者: Yoon, TaeHo Kim, Jaeyeon Suh, Jaewook J. Ryu, Ernest K. Department of Mathematical Sciences Seoul National University Korea Republic of Department of Mathematics University of California Los Angeles United States
Recently, accelerated algorithms using the anchoring mechanism for minimax optimization and fixed-point problems have been proposed, and matching complexity lower bounds establish their optimality. In this work, we pr... 详细信息
来源: 评论
A Modified Wei-Yao-Liu Stochastic Conjugate Gradient Algorithm in Machine Learning
A Modified Wei-Yao-Liu Stochastic Conjugate Gradient Algorit...
收藏 引用
2024 International Conference on Computational Intelligence and Communication System, CCICS 2024
作者: Mo, Zhongyu Yuan, Gonglin Deng, Wei Guangxi University Guangxi Nanning China School of Finance and Economics Nanning College for Vocational Technology Guangxi Nanning China
The Wei-Yao-Liu (WYL) Conjugate Gradient (CG) algorithm exhibits favourable attributes, notably sufficient descent and trust domain characteristics, in the context of solving unconstrained optimization problems. The e... 详细信息
来源: 评论
Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling  41
Efficient Exploration in Average-Reward Constrained Reinforc...
收藏 引用
41st International Conference on Machine Learning, ICML 2024
作者: Provodin, Danil Kaptein, Maurits Pechenizkiy, Mykola Eindhoven University of Technology Eindhoven Netherlands Jheronimus Academy of Data Science 's-Hertogenbosch Netherlands University of Jyväskylä Jyväskylä Finland
We present a new algorithm based on posterior sampling for learning in Constrained Markov Decision Processes (CMDP) in the infinite-horizon undiscounted setting. The algorithm achieves near-optimal regret bounds while... 详细信息
来源: 评论
optimization-based damage detection in composite structures using incomplete measurements
收藏 引用
STRUCTURES 2023年 56卷
作者: Hassani, Sahar Dackermann, Ulrike Univ New South Wales Ctr Infrastruct Engn & Safety Sch Civil & Environm Engn Sydney NSW Australia
Incomplete data poses challenges in accurately assessing structural health and detecting damage. It limits the ability to capture the complete behavior and response of the structure, which may hinder the identificatio... 详细信息
来源: 评论
First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
arXiv
收藏 引用
arXiv 2021年
作者: Postek, Krzysztof Shtern, Shimrit Faculty of Electrical Enginnering Mathematics and Computer Science Delft University of Technology Delft Netherlands Faculty of Industrial Engineering and Management Technion - Israel Institute of Technology Haifa Israel
Robust optimization (RO) is one of the key paradigms for solving optimization problems affected by uncertainty. Two principal approaches for RO, the robust counterpart method and the adversarial approach, potentially ... 详细信息
来源: 评论