检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

3,673 篇 工学
- 2,095 篇 计算机科学与技术...
- 1,457 篇 软件工程
- 741 篇 电气工程
- 612 篇 控制科学与工程
- 332 篇 机械工程
- 325 篇 信息与通信工程
- 154 篇 动力工程及工程热...
- 148 篇 石油与天然气工程
- 129 篇 电子科学与技术（可...
- 128 篇 土木工程
- 91 篇 材料科学与工程（可...
- 89 篇 仪器科学与技术
- 75 篇 环境科学与工程（可...
- 72 篇 交通运输工程
- 69 篇 力学（可授工学、理...
- 64 篇 建筑学
- 61 篇 化学工程与技术
- 57 篇 水利工程
- 55 篇 航空宇航科学与技...
- 47 篇 生物医学工程（可授...
1,885 篇 理学
- 1,454 篇 数学
- 230 篇 系统科学
- 197 篇 物理学
- 197 篇 统计学（可授理学、...
- 68 篇 化学
- 60 篇 生物学
389 篇 管理学
- 338 篇 管理科学与工程(可...
- 72 篇 工商管理
- 48 篇 图书情报与档案管...
95 篇 医学
54 篇 经济学
- 51 篇 应用经济学
28 篇 农学
21 篇 法学
16 篇 教育学
9 篇 文学
3 篇 军事学
2 篇 艺术学

主题

4,005 篇 optimization alg...
270 篇 optimization
190 篇 algorithms
98 篇 machine learning
88 篇 design
65 篇 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...
6 篇 georgia inst tec...
6 篇 department of co...
6 篇 google research ...
6 篇 school of artifi...
6 篇 semnan univ dept...
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
11 篇 ehteram mohammad
9 篇 gandomi amir h.
9 篇 hasanipanah mahd...
9 篇 notarstefano giu...
9 篇 ishibuchi hisao
8 篇 zhan zhi-hui
8 篇 zhang jun
7 篇 neumann frank
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 aneta
6 篇 wang lei
6 篇 zhang lei
6 篇 yang shengxiang

语言

3,501 篇 英文
441 篇 其他
51 篇 中文
5 篇 土耳其文
4 篇 斯洛文尼亚文
3 篇 法文
1 篇 德文
1 篇 西班牙文
1 篇 塞尔维亚文

检索条件"主题词=Optimization algorithms"

共 4005 条记录，以下是781-790 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Three-Dimensional Path Planning of Unmanned Aerial Vehicle Based on Hybrid Strategy and Improved Dung Beetle optimization Algorithm 4

Three-Dimensional Path Planning of Unmanned Aerial Vehicle B...

引用

4th International Conference on Electronic Information Engineering and Computer Technology, EIECT 2024

作者： Yang, Chenming Dong, Xuezhen Dalian Polytechnic University Dalian China

ISBN: (纸本)9798331528850

As an effective path exploration technology, dung Beetle algorithm has been widely used in the path planning of unmanned aerial vehicle autonomous navigation. In this paper, a 3D path planning strategy for unmanned aerial vehicles (UAS) is proposed by optimizing the dung beetle algorithm, aiming to overcome the challenges of local optimal traps, redundant turning points and low convergence efficiency encountered by traditional intelligent bionic algorithms when dealing with complex spatial path planning of UAS. First, based on mathematical modeling technology, we built a three-dimensional simulation environment of mountain terrain, and precisely set the objective function and constraint conditions of the UAV to ensure the authenticity and practicability of the experiment scene. We innovatively introduced Fuch and Logistic chaotic mapping mechanisms to optimize the initial population allocation of the dung beetle algorithm, which significantly enhanced the global exploration capability of the algorithm. At the same time, we designed an adaptive nonlinear decline strategy to dynamically regulate the number of dung beetles in different stages of the algorithm, thus accelerating the convergence process of the algorithm. In addition, in order to achieve smooth transition of the path, we use Bessel curve technology to perform fine processing on the generated path. © 2024 IEEE.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Prospect Theory-Based Formulation of Portfolio optimization Problem using Loan And Its Solution by Evolutionary Algorithm 13

Prospect Theory-Based Formulation of Portfolio Optimization ...

引用

Joint 13th International Conference on Soft Computing and Intelligent Systems and 25th International Symposium on Advanced Intelligent Systems, SCIS and ISIS 2024

作者： Tagawa, Kiyoharu Orito, Yukiko Faculty of Informatics Kindai University Dept. of Informatics Higashi-Osaka Osaka Japan College of Engineering Tamagawa University Dept. of Management Science Machida Tokyo Japan

ISBN: (纸本)9798350373332

Portfolio optimization that allows the borrowed money from a loan to be invested in risk assets is formulated as a data-driven optimization problem called POL_P. Then, in order to reflect investor preferences called 'values' in the solution, or the portfolio, prospect theory is used to extend POL_P to another optimization problem called POL_ V. POL_P maximizes the profit of the portfolio, while POL_ V maximizes the value of the portfolio. An evolutionary algorithm with a novel constraint-handling technique is proposed for solving POL_P and POL_ V. Finally, the solutions to POL_P and POL_ V are compared and discussed through experiments using historical asset data. © 2024 IEEE.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A Mutation Lion Swarm optimization Algorithm Based on Proportional Strategy 24

A Mutation Lion Swarm Optimization Algorithm Based on Propor...

引用

3rd Asia Conference on algorithms, Computing and Machine Learning, CACML 2024

作者： Zhao, Ze Jiang, Mingyan Yuan, Dongfeng Jiang, Keqin Wang, Feng Zhou, Xiaotian School of Information Science and Engineering Shandong University China Qilu Institute of Technology China

ISBN: (纸本)9798400716416

During the iterative process, the probability of selection is directly linked to the fitness magnitude, as each iteration of swarm intelligence optimization algorithms progressively converges towards an optimal solution. Building upon this premise, we introduce the Lion Swarm optimization Algorithm based on the Proportional Strategy (PLSO), designed to enhance convergence speed and achieve superior optima. Inspired by the roulette strategy, our approach integrates the concept into the Lion Swarm optimization (LSO) algorithm. In essence, it mimics the behavior of lion cubs, who learn hunting by following lionesses;however, their choice of lioness to follow is governed by rationality, favoring those with superior hunting skills. This fosters knowledge transfer among lionesses, strengthening the link between global and local optima, thereby enhancing local search capabilities and significantly accelerating convergence. In this paper, we evaluate the performance of the PLSO algorithm against six single-peak test functions, four multi-peak test functions, and four additional functions, chosen randomly. Comparative analyses are conducted with classical optimization algorithms, and the PLSO algorithm is applied to address the image segmentation problem. Our findings demonstrate the superior efficacy and robustness of the PLSO algorithm. © 2024 ACM.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Data Clustering Using Social Group optimization Algorithm 1

引用

8th International Conference on Information System Design and Intelligent Applications, ISDIA 2024

作者： Nagesh Meesala, Y.V. Parida, Ajaya Kumar School of Computer Engineering KIIT Deemed to be University Bhubaneswar India CSE Department Raghu Engineering College Visakhapatnam India

ISBN: (数字)9789819786664

ISBN: (纸本)9789819786657

A newly developed optimization technique, known as "Social Group optimization (SGO)," has been recently introduced by S.C. Satapathy and colleagues. This innovative method presents an effective strategy for addressing global optimization problems. The paper also puts forth a novel approach to cluster data utilizing the SGO method. It demonstrates that SGO can effectively determine the centroids for a user-defined number of clusters, much like other conventional clustering techniques. To assess its performance, the SGO algorithms are evaluated using various datasets and are compared against established clustering methods, including K-means (KMs), Particle Swarm optimization (PSO) clustering, Differential Evolution (DE) clustering, and Teaching Learning-Based optimization (TLBO) clustering. The results of these evaluations suggest that the SGO clustering technique holds substantial promise and may outperform other existing techniques. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Beta Random Restart Strategy-Based Remora optimization Algorithm for Global optimization 14

Beta Random Restart Strategy-Based Remora Optimization Algor...

引用

14th International Conference on Information Science and Technology, ICIST 2024

作者： Ai, Zekai Shi, Xiaoming Jia, Heming Yang, Jie Xue, Bowen Du, Yilong College of Design and Engineering National University of Singapore Singapore School of Information Engineering Sanming University Sanming China School of Electrical and Information Engineering Northeast Petroleum University Daqing China College of Information and Electrical Engineering Heilongjiang Bayi Agricultural University Daqing China

ISBN: (纸本)9798350353334

The Remora optimization Algorithm (ROA) is a meta-heuristic algorithm that imitates the foraging behaviors of Remora. Its main idea lies in simulating the mechanism of switching hosts during the foraging process of remora. Due to the randomness of remora host selection, ROA frequently gets trapped in local optima, which slows down its convergence speed. To develop a more robust algorithm, this paper simulates the exploration and elimination mechanism in the biological evolution process and improves the random restart strategy with 'prior' properties. Beta Random Restart Strategy-based Remora optimization Algorithm (BROA) is proposed to realize global optimization. The proposed Beta-random restart strategy ranks individuals by fitness and restarts the less fit half. The Cauchy strategy is used to expand the search area and enhance the ability to escape from local optima. This paper meticulously assesses the performance of BROA using five comparison algorithms. Firstly, the optimization capabilities of BROA are assessed through CEC2020 tests. The Wilcoxon test assesses the difference between BROA and five different algorithms. Finally, Cantilever Beam Design problem is used for testing the practicability of BROA. Comprehensive results show that BROA performs best in CEC2020 and the cantilever beam design problem compared with five different optimization algorithms. © 2024 IEEE.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhancing Student Performance Prediction with Greylag Goose optimization Algorithm

Enhancing Student Performance Prediction with Greylag Goose ...

引用

2024 International Telecommunications Conference, ITC-Egypt 2024

作者： Rizk, Faris H. Mohamed, Mahmoud Elshabrawy Sameh, Basant Zaki, Ahmed Mohamed Eid, Marwa M. El-Kenawy, El-Sayed M. Computer Science and Intelligent Systems Research Center BlacksburgVA24060 United States Delta Higher Institute of Engineering and Technology Department of Communications and Electronics Mansoura35111 Egypt Delta University for Science and Technology Faculty of Artificial Intelligence Mansoura35111 Egypt

ISBN: (纸本)9798350351408

The current paper addresses the central role of hyperparameter optimization in improving the predictive power of the MLP Regressor for forecasting student performance in Portuguese secondary schools. The uniqueness of this research lies in its exploration of metaheuristic optimization algorithms, specifically highlighting GGO (Greylag Goose optimization) for enhancement. The study utilized a dataset crucial for understanding and predicting student performance, with a special focus on its distinctive features. By comprehensively tuning the MLP Regressor, the paper demonstrates remarkable improvements in various performance measures, as evident in the enclosed tables. Specifically, the MSE values calculated for the MLP Regressor both before and after GGO optimization are compared. Without optimization, the MLP Regressor had an MSE of 0.0103. After GGO optimization, the MSE significantly improved to 0.0060, indicating enhanced accuracy with GGO in the model. These findings emphasize that hyperparameter optimization, particularly the GGO technique, is crucial for refining the MLP Regressor in predicting student performance. The paper not only delves into the technical aspects but also concludes by highlighting the broader consequences of these outcomes. The potential educational applications are substantial, as improved models can provide more accurate predictions, empowering educators and policymakers to make informed decisions in education. This paper establishes a foundation for future research directions, contributing to the pool of ideas for educational predictive modeling. © 2024 IEEE.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Principled Preferential Bayesian optimization 41

Principled Preferential Bayesian Optimization

引用

41st International Conference on Machine Learning, ICML 2024

作者： Xu, Wenjie Wang, Wenbin Jiang, Yuning Svetozarevic, Bratislav Jones, Colin N. Automatic Control Laboratory EPFL Lausanne Switzerland Urban Energy Systems Laboratory Empa Zurich Switzerland The Institute for Artificial Intelligence Research and Development of Serbia Serbia

We study the problem of preferential Bayesian optimization (BO), where we aim to optimize a black-box function with only preference feedback over a pair of candidate solutions. Inspired by the likelihood ratio idea, we construct a confidence set of the black-box function using only the preference feedback. An optimistic algorithm with an efficient computational method is then developed to solve the problem, which enjoys an information-theoretic bound on the total cumulative regret, a first-of-its-kind for preferential BO. This bound further allows us to design a scheme to report an estimated best solution, with a guaranteed convergence rate. Experimental results on sampled instances from Gaussian processes, standard test functions, and a thermal comfort optimization problem all show that our method stably achieves better or competitive performance as compared to the existing state-of-the-art heuristics, which, however, do not have theoretical guarantees on regret bounds or convergence. Copyright 2024 by the author(s)

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi sensor and multi task allocation based on improved whale optimization algorithm 34th

Multi sensor and multi task allocation based on improved wha...

引用

34th Congress of the International Council of the Aeronautical Sciences, ICAS 2024

作者： Yuano, Binlin Zhang, Shifeng Wang, Boxuan Zhang, Kun College of Aerospace Science and Engineering National University of Defense Technology Changsha China Sichuan Tengden Technology Co. Ltd Chengdu China School of Electronic and Information Northwestern Polytechnical University Xi’an China

In response to the collaborative detection problem of unmanned aerial vehicle (UAV) formations in dual aircraft formation cluster operations, this paper constructs an optimization model with detection benefits and detection costs as the objectives based on task priority, and designs an improved whale optimization algorithm to solve the model. Firstly, an elite population initialization based on multiple constraint conditions was proposed, and secondly, an improved method for updating whale individual positions was proposed by combining model characteristics. Subsequently, a local search strategy was designed to enable the algorithm to escape from local optima. Finally, the effectiveness of the proposed algorithm in solving task allocation problems was verified through simulation experiments. Compared with the Harris Eagle algorithm, the improved whale optimization algorithm obtains a higher quality non dominated solution set, indicating that the algorithm has certain advantages. © 2024, International Council of the Aeronautical Sciences. All rights reserved.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Improvement of Grasshopper optimization Algorithm Based on Chaotic Mapping and Levy Flight 2

Improvement of Grasshopper Optimization Algorithm Based on C...

引用

2nd International Conference on Signal Processing and Intelligent Computing, SPIC 2024

作者： Liu, Wei Han, Guangyu Ren, Tengteng Zhang, Chuang Li, Tong Shenyang Ligong University College of Information Science and Engineering Shenyang China Ocean University of China Department of Information Science and Engineering Qingdao China

ISBN: (纸本)9798350368888

A recently developed population-intelligent optimization method, the grasshopper optimization algorithm (GOA) has been effectively used in numerous real-world applications. However, this algorithm has flaws like poor convergence speed and propensity to enter local optima. A grasshopper optimization algorithm based on chaos initialization and Levy flying (CLGOA) was thus presented to address these problems with grasshopper optimization methods and to enhance their performance. First, the population is initialized using Sine chaotic mapping, which makes it more uniform;Second, adjust the position-determining parameter c and use it as the weight for the ideal location to balance the algorithm's capacities for development and exploration;In order to help the algorithm exit the local region and locate the global optimal value throughout the optimization phase, the Levy flight mechanism is introduced last. By selecting 6 test functions (divided into unimodal and multimodal functions) to evaluate the performance of the algorithm, and comparing the average and variance of 30 consecutive experimental results with other algorithms, it is demonstrated that CLGOA has strong optimization performance. The suggested algorithm CLGOA's excellent optimization capabilities were demonstrated, strengthening the algorithm's robustness and convergence capabilities. © 2024 IEEE.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on the optimization Algorithm to Avoid Malicious Code Attacks 24

Research on the Optimization Algorithm to Avoid Malicious Co...

引用

9th International Conference on Cyber Security and Information Engineering, ICCSIE 2024

作者： Gao, Ruimei Zhang, Lina Southeast University Chengxian College China

ISBN: (纸本)9798400718137

In order to solve the accuracy, time consuming and anti-detection ability of traditional LAN malicious attack code classification method, this paper proposes a LAN malicious code classification method based on improved optimization algorithm. This method adopts 3 D coordinate technology to expand the spatial location of malicious code to a wider range, so as to improve the characteristics of malicious code, so as to effectively prevent malicious attacks. To solve the time-consuming problem, a new transfer learning technology is adopted to improve the anti-confounding ability. In addition, in order to solve the problem of large network computing volume and slow code recovery speed, the MobileNetV3 convolutional neural network model is adopted, combined with the Ranger optimization algorithm technology, to speed up the time-consuming network convergence process. Both the CIFAR-10 and VisualQA datasets achieved 93.5% and 91.2%, with a 2.3% improvement in accuracy and a 25% improvement in detection efficiency compared to Sentiment140. The improved algorithm has significantly improved the accuracy in the classification than the traditional method, reaching the level of 1.05%. These improved algorithms not only improve the accuracy of the model, but also enhance the resistance to confounding, and improve the efficiency of classification detection. © 2024 Copyright held by the owner/author(s).

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共401页 << < 75 76 77 78 79 80 81 82 83 84 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：