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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

162 篇 期刊文献
144 篇 会议
1 篇 学位论文

馆藏范围

307 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

276 篇 工学
- 158 篇 计算机科学与技术...
- 70 篇 电气工程
- 58 篇 控制科学与工程
- 37 篇 信息与通信工程
- 35 篇 软件工程
- 34 篇 机械工程
- 20 篇 材料科学与工程（可...
- 16 篇 仪器科学与技术
- 13 篇 土木工程
- 12 篇 电子科学与技术（可...
- 10 篇 交通运输工程
- 7 篇 力学（可授工学、理...
- 5 篇 建筑学
- 5 篇 石油与天然气工程
- 4 篇 环境科学与工程（可...
- 4 篇 网络空间安全
- 3 篇 测绘科学与技术
- 3 篇 船舶与海洋工程
- 3 篇 核科学与技术
57 篇 管理学
- 55 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
42 篇 理学
- 19 篇 数学
- 10 篇 生物学
- 9 篇 物理学
- 6 篇 化学
- 2 篇 地球物理学
7 篇 教育学
- 5 篇 教育学
- 2 篇 心理学(可授教育学...
4 篇 经济学
- 2 篇 理论经济学
3 篇 农学
3 篇 医学
- 3 篇 临床医学
2 篇 法学
1 篇 文学

主题

307 篇 ant colony optim...
27 篇 path planning
24 篇 genetic algorith...
8 篇 ant colony optim...
7 篇 particle swarm o...
6 篇 traveling salesm...
6 篇 optimization
6 篇 mobile robot
6 篇 artificial intel...
6 篇 feature selectio...
6 篇 cloud computing
5 篇 multi-objective ...
5 篇 load balancing
5 篇 artificial bee c...
5 篇 data mining
5 篇 combinatorial op...
5 篇 scheduling
4 篇 primary-backup a...
4 篇 pid controller
4 篇 heuristic based ...

机构

4 篇 hefei univ techn...
3 篇 chongqing techno...
3 篇 nanyang technol ...
3 篇 northeastern uni...
3 篇 new jersey inst ...
3 篇 anhui univ sch c...
3 篇 univ hong kong f...
2 篇 natl cheng kung ...
2 篇 shanghai jiao to...
2 篇 changshu inst te...
2 篇 southwest jiaoto...
2 篇 dalian jiaotong ...
2 篇 univ hyderabad s...
2 篇 minist educ key ...
2 篇 tamkang univ dep...
2 篇 yonsei univ dept...
2 篇 shandong xiehe c...
2 篇 northwestern pol...
2 篇 silesian tech un...
2 篇 natl tsing hua u...

作者

5 篇 xiao wensheng
5 篇 wu lei
4 篇 jia zhao-hong
4 篇 yang jia
4 篇 xu qiang
4 篇 liu chao
4 篇 li kai
3 篇 afshar m. h.
3 篇 li lin-lin
3 篇 xu yaping
3 篇 wang deliang
3 篇 slota damian
3 篇 zheng yaqian
3 篇 li yanyan
3 篇 huang xiaodong
2 篇 leite walter l.
2 篇 shaofei zang
2 篇 cui junguo
2 篇 xu benlian
2 篇 moon byungin

语言

286 篇 英文
15 篇 其他
6 篇 中文

检索条件"主题词=Ant Colony Optimization algorithm"

共 307 条记录，以下是251-260 订阅

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

详细简洁

排序：

A new approach of ant colony algorithm and its proof of convergence

A new approach of ant colony algorithm and its proof of conv...

引用

6th World Congress on Intelligent Control and Automation

作者： Zuo, Hong-hao Xiong, Fan-lun Univ Sci & Technol China Dept Automat POB 1130 Hefei Anhui Province Peoples R China Chinese Acad Sci Inst Intelligent Machines Hefei Anhui Province Peoples R China

ISBN: (纸本)1424403316

ant colony optimization algorithm, which is based on bionics, has been successfully used in many fields, especially on combinatorial optimization problems. While many parameters need to be adjusted in its application, it is inconvenient for rookies. A novel ant colony optimization algorithm based on real time model is proposed and its proof of convergence is given. It is supposed that each ant's velocity is the same and all ants are crawling in full time. ants communicate with others by the pheromone that is left on the road. After some time the ants trail will be on the optimal route between the food and the nest. It is testified by the experiment that the novel algorithm is as well as other ant colony algorithm and it is simpler to justify the parameters than before.

关键词： ant colony optimization algorithm time model convergence traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

An Approach for Fault Diagnosis based on Bio-inspired Strategies

An Approach for Fault Diagnosis based on Bio-inspired Strate...

引用

2010 IEEE World Congress on Computational Intelligence

作者： Echevarria, Lidice Camps Santiago, Orestes Llanes da Silva Neto, antonio Jose Inst Super Politecn Jose Antonio Echeverria Dept Math Calle 114 Entre 127 & 149 Havana Cuba UERJ IPRJ Dept Mech Engn & Energy Nova Friburgo RJ Brazil

ISBN: (纸本)9781424481262

In this work we present a study on the application of bio-inspired strategies for optimization to Fault Diagnosis in industrial systems. The principal aim is to establish a basis for the development of new and viable model-based Fault Diagnosis Methods which improve some difficulties that the current methods cannot avoid. These difficulties are related with fault sensitivity and robustness to external disturbances. To get start the study, we consider the Differential Evolution and the ant colony optimization algorithms. This application is illustrated using simulation data of the Two Tanks System benchmark. In order to analyze the merits of these algorithms to obtain a diagnosis which needs to be sensitive to faults and robust to external disturbances, some experiments with incipient faults and noisy data have been simulated. The results indicate that the proposed approach, basically the combination of the two algorithms, characterizes a promising methodology for Fault Diagnosis.

关键词： ant colony optimization algorithm bio-inspired strategy differential evolution evolutionary computation fault diagnosis fault diagnosis optimization industrial system model-based fault diagnosis method two tanks system benchmark

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Detecting Points Path Planning algorithm for Climbing Robot in Spatial Trusses

Hierarchical Detecting Points Path Planning Algorithm for Cl...

引用

International Conference on Robotics and Automation Sciences (ICRAS)

作者： Liao, Erchong Liu, Changan Jiang, Limei North China Elect Power Univ Sch Control & Comp Engn Baoding Peoples R China

ISBN: (纸本)9781538639955

To solve climbing robot path planning in spatial trusses with detecting points, a hierarchical algorithm is proposed according to the divide-and-conquer strategy. Path planning problem with large-scale detecting points is decomposed into a number of path planning sub-problems with small-scale detecting points by Density Peaks Clustering algorithm(DPC), and then all sub-problems with small-scale detecting points are resolved by ant colony optimization algorithm(ACO). At last, all the paths obtained from each sub-problem are merged, and local path is optimized by 2-Opt and 3-Opt algorithms. The hierarchical algorithm is tested on 5 different instances. Experimental results show that the proposed algorithm has the same accuracy and computational complexity can be decreased n squared compared with ACO algorithm. The efficiency has been significantly improved.

关键词： climbing robot path planning density peaks clustering algorithm ant colony optimization algorithm traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

AB-Chord: An Improved Chord Based on ant colony optimizationand Bi-directional Lookup Routing 6

AB-Chord: An Improved Chord Based on Ant Colony Optimization...

引用

6th International Symposium on Parallel Architectures, algorithms, and Programming (PAAP)

作者： Zhao, Limin Shen, Hong Li, Yidong Wu, Jun Beijing Jiaotong Univ Sch Comp & Informat Technol Beijing Peoples R China Sun Yat Sen Univ Sch Informat Sicnece & Technol Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781479938445

Chord is a popular and successful topology for P2P data sharing. However, the conventional chord has an obvious drawback - it fails to consider the physical topology of the P2P network for designing the lookup solution, which may bring tremendous delay to network routing. In order to address the drawback and further speeds up searching for local resources, we propose an improved chord based on the ant colony optimization algorithm and Bi-directional lookup routing method in this paper. We first apply the ant colony optimization algorithm for building the chord ring to match the topology between the overlay network and physical network. We then develop a bi-directional lookup routing mechanism to further speed up searching for local resources. Simulation results show that our improved chord scheme is significantly more efficient than the conventional chord method.

关键词： P2P Chord ant colony optimization algorithm Bi-directional Routing

来源：评论

学校读者我要写书评

暂无评论

Improved ant colony algorithm and Application in Sequence Images of Prostate DWI Registration 4

Improved Ant Colony Algorithm and Application in Sequence Im...

引用

4th International Conference on Intelligent System and Applied Material (GSAM)

作者： Zong, Xiaoping Zhang, Haibin Hao, Lei Wang, Peiguang Hebei Univ Sch Elect & Informat Engn Baoding 071002 Peoples R China

ISBN: (纸本)9783038353140

Because of the drift which exists in sequence image of prostate DWI (Diffusion Weighted Imaging), the global ant colony algorithm is introduced into the paper for registration optimization. The paper introduces an ant colony algorithm for continuous function optimization, based on max-min ant system (MMAS). This paper controls the transition probabilities and enhances the abilities of ants seeking globally optimal solutions by adding an adjustable factor in the basic ant colony algorithm and updating the local pheromone and global pheromone. Experimental results verify the effectiveness of the algorithm.

关键词： Diffusion Weighted Imaging (DWI) image registration continuous function pheromone ant colony optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Distribution Network Reconfiguration for Load Balancing

Optimal Distribution Network Reconfiguration for Load Balanc...

引用

China International Conference on Electricity Distribution (CICED)

作者： Yan Yuehao Zhang Zhongqing Bao Wei Xin Jun Qin Limin Du Yaoheng State Grid Zhengzhou Elect Power Supply Co Zhengzhou 450000 Henan Peoples R China Zhengzhou Univ Zhengzhou 450000 Henan Peoples R China

ISBN: (纸本)9781467390682

To cope with increasingly serious three-phase disequilibrium in distribution network, a reconfiguration model is proposed for distribution network with the optimization objective of reducing three-phase disequilibrium. First by analyzing the distribution network in topology, the distribution network reconfiguration problem is converted into a problem of constructing spanning tree of the graph, which is solved by breaking-cycle-basis method. Then by selecting the first-branch randomly and canceling the heuristic value of network, an improved ant colony optimization algorithm is proposed to solve the reconfiguration problem, which can expand the search extent and avoid search stagnation. Specific examples of verification prove that the proposed algorithm can obtain the global best solution with less computation time and higher probability compared to the conventional methods.

关键词： Thriv-phase disequilibrium Distribution network reconstruction ant colony optimization algorithm Graph theory

来源：评论

学校读者我要写书评

暂无评论

Workflow Task Scheduling algorithm Based on IFCM and IACO 4th

Workflow Task Scheduling Algorithm Based on IFCM and IACO

引用

4th International Conference on Cloud Computing and Security (ICCCS)

作者： Liu, Qin Ma, Tinghuai Li, Jian Shen, Wenhai Nanjing Univ Informat Sci Technol Sch Comp Software Nanjing 210044 Jiangsu Peoples R China Nanjing Univ Informat Sci Technol Jiangsu Engn Ctr Network Monitoring CICAEET Nanjing 210044 Jiangsu Peoples R China Natl Meteorol Informat Ctr Beijing 100080 Peoples R China

ISBN: (纸本)9783030000097;9783030000080

To solve the scheduling problem of workflow tasks in cloud computing, this paper combined the improved fuzzy c-means clustering algorithm (IFCM) and the improved ant colony optimization algorithm (IACO) and proposed a new workflow task scheduling algorithm. Firstly, the proposed algorithm used the IFCM to classify resources. Then, tasks will be sorted by their priority. Based on the results of resource clustering and the distance between resources and expect of tasks, tasks will be assigned to the appropriate resources and the scheduling will be initialized. After that, the workflow tasks will be encoded based on the initial scheduling. At last, ant colony optimization algorithm will be improved by the cross and mutation operation in genetic algorithm and used to search optimal schedules. The experiments showed that the proposed algorithm could quickly and efficiently find appropriate scheduling scheme, effectively reduce the time span of workflow tasks and increase the utilization of resources.

关键词： Cloud computing Workflow task scheduling Fuzzy clustering algorithm ant colony optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Design and Optimisation of Pressure Vessel Using Metaheuristic Approach

Design and Optimisation of Pressure Vessel Using Metaheurist...

引用

4th International Conference on Mechanical and Manufacturing Engineering (ICME 2013)

作者： Hassan, Sulaiman Kumar, Kavi Raj, Ch Deva Sridhar, Kota Univ Tun Hussein Onn Malaysia Mech & Mfg Dept Batu Pahat Johar Malaysia Univ Tun Hussein Onn Malaysia Fac Sci Technol & Human Dev Bangi Malaysia Dept Mech Engn RVR JC Guntur India Univ Tun Hussein Onn Malaysia Mech Mfg Dept Bangi Malaysia

ISBN: (纸本)9783037859339

The objective of design optimization of pressure vessels is cost reduction by reducing weight with adequate strength and stiffness. optimization is the act of obtaining the best result under given circumstances. Conventional design aims at finding acceptability design which merely satisfies the functional and other requirements of the problem. In general, there will be more than one acceptable designs and the purpose of design optimization is to choose the best. In the present work parameters such as thickness of the shell, and dish end, length and radius of the pressure vessel are optimized by making use of ACO has been shown for a Pressure vessel problem with four variables and four design constraints. It is found that the results obtained from ACO are better as its search is for global optimum as against the local optimum in traditional search methods. The results of the ACO have been checked using ANSYS, and it is found to perform satisfactorily.

关键词： Design optimization ant colony optimization algorithm Pressure Vessels

来源：评论

学校读者我要写书评

暂无评论

Experimental Study on a Hybrid Nature-Inspired algorithm for Financial Portfolio optimization

引用

6th Hellenic Conference on Artificial Intelligence

作者： Giannakouris, Giorgos Vassiliadis, Vassilios Dounias, George Univ Aegean Dept Financial & Management Engn Management & Decis Engn Lab GR-82100 Aegean Greece

ISBN: (纸本)9783642128417

Hybrid intelligent schemes have proven their efficiency in solving NP-hard optimization problems. Portfolio optimization refers to the problem of finding the optimal combination of assets and their corresponding weights which satisfies a specific investment goal and various constraints. In this study, a hybrid intelligent metaheuristic, which combines the ant colony optimization algorithm and the Firefly algorithm, is proposed in tackling a complex formulation of the portfolio management problem. The objective function under consideration is the maximization of a financial ratio which combines factors of risk and return. At the same time, a hard constraint, which refers to the tracking ability of the constructed portfolio towards a benchmark stock index, is imposed. The aim of this computational study is twofold. Firstly, the efficiency of the hybrid scheme is highlighted. Secondly, comparison results between alternative mechanisms, which are incorporated in the main function of the hybrid scheme, are presented.

关键词： ant colony optimization algorithm firefly algorithm portfolio optimization hybrid NII algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Hybrid Path Planning algorithm at Macroscopic Level for Autonomous Climbing Robot 3

A Novel Hybrid Path Planning Algorithm at Macroscopic Level ...

引用

3rd International Conference on Robotics and Automation Engineering (ICRAE)

作者： Liao, Erchong North China Elect Power Univ Sch Control & Comp Engn Baoding Peoples R China

ISBN: (纸本)9781538695944

This paper proposed a novel hybrid algorithm for path planning at macroscopic level for autonomous climbing robot. The path planning is an Asymmetric Traveling Salesman Problem (ATSP). The problem can be decomposed into some groups with small-scale points by Density Peaks Clustering algorithm (DPC), and these groups are divided into two types based on the node distribution: dense groups and sparse groups. Then local paths for all groups are solved by ant colony optimization algorithm (ACO) and merged at the nearest pair of points between the two adjacent groups to generate the initial global path. At last, the final global path is obtained after optimizing by K-Opt algorithms. The proposed algorithm is tested on nine benchmark instances compared with four other algorithms. Simulation experiment result shows that the proposed algorithm can provide the solution with higher accuracy and shorter runtime.

关键词： path planning climbing robot asymmetric traveling salesman problem density peaks clustering algorithm ant colony optimization algorithm K-Opt algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共31页 << < 22 23 24 25 26 27 28 29 30 31 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：