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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

144 篇 会议
89 篇 期刊文献
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

205 篇 工学
- 113 篇 计算机科学与技术...
- 58 篇 电气工程
- 47 篇 控制科学与工程
- 29 篇 软件工程
- 24 篇 信息与通信工程
- 16 篇 机械工程
- 10 篇 电子科学与技术（可...
- 10 篇 交通运输工程
- 9 篇 仪器科学与技术
- 5 篇 土木工程
- 5 篇 航空宇航科学与技...
- 4 篇 力学（可授工学、理...
- 4 篇 材料科学与工程（可...
- 4 篇 动力工程及工程热...
- 4 篇 石油与天然气工程
- 3 篇 水利工程
- 3 篇 城乡规划学
- 2 篇 化学工程与技术
59 篇 管理学
- 58 篇 管理科学与工程(可...
- 4 篇 工商管理
29 篇 理学
- 18 篇 数学
- 4 篇 物理学
- 3 篇 生物学
- 3 篇 系统科学
- 2 篇 化学
6 篇 经济学
- 4 篇 理论经济学
- 4 篇 应用经济学
5 篇 医学
- 4 篇 临床医学
2 篇 法学
- 2 篇 政治学
- 2 篇 社会学
1 篇 教育学
1 篇 文学
1 篇 农学

主题

235 篇 ant algorithm
25 篇 ant colony optim...
17 篇 optimization
12 篇 algorithms
12 篇 genetic algorith...
11 篇 ants
9 篇 routing
8 篇 clustering
8 篇 swarm intelligen...
7 篇 path planning
7 篇 administrative c...
7 篇 multicast routin...
7 篇 qos
6 篇 ant colony optim...
5 篇 particle swarm o...
5 篇 optimization alg...
4 篇 genetic algorith...
4 篇 transport
4 篇 pheromone
4 篇 planning

机构

2 篇 wuhan univ techn...
2 篇 city univ hong k...
2 篇 tianjin univ sch...
2 篇 department of el...
2 篇 brno university ...
2 篇 iran univ sci & ...
2 篇 natl sun yat sen...
2 篇 univ nebraska de...
2 篇 hebei university...
2 篇 iran univ sci & ...
1 篇 wenzhou univ ins...
1 篇 universitas meth...
1 篇 shandong normal ...
1 篇 warsaw univ tech...
1 篇 univ bremen dept...
1 篇 helwan univ dept...
1 篇 univ torbat heid...
1 篇 fraunhofer insti...
1 篇 avic radar and a...
1 篇 warsaw univ tech...

作者

4 篇 li layuan
3 篇 afshar m. h.
3 篇 izdebski mariusz
3 篇 gong bencan
2 篇 jun-hua gu
2 篇 klymash mykhailo
2 篇 kendall g
2 篇 yang yang
2 篇 sari riri fitri
2 篇 lorenz pascal
2 篇 anuntachai anunt...
2 篇 lebedev o. b.
2 篇 middendorf m
2 篇 dasgupta p
2 篇 alyguliev r. m.
2 篇 abouaissa abdelh...
2 篇 gu jun-hua
2 篇 chen chia-mei
2 篇 zhu qingbao
2 篇 simaremare harri...

语言

224 篇 英文
7 篇 其他
3 篇 中文

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

共 235 条记录，以下是21-30 订阅

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

详细简洁

排序：

Rolling Path Planning of Mobile Robot Based on Automatic Diffluence ant algorithm 12

Rolling Path Planning of Mobile Robot Based on Automatic Dif...

引用

12th International Conference on Graphics and Image Processing (ICGIP)

作者： Guo Haitao Qin Jilin ShangYuxin Shandong Inst Commerce & Technol Informat Technol Coll Jinan 250103 Shandong Peoples R China

ISBN: (纸本)9781510642782;9781510642775

This paper proposes a new method of robot path rolling planning based on automatic shunt ant algorithm. When a node is selected by multiple ants, later ants choose other paths to realize automatic shunting, thereby expanding the search range, enhancing the search diversity, and helping to obtain the optimal solution. The overall idea of the algorithm in this paper is to map the target point near the inner boundary of the robot's field of view, and use the new algorithm to plan the local optimal path of the robot, and the robot will move forward according to this local path. The robot repeats the process every time it advances, and reaches the end safely along a globally optimized path. Simulation experiments show that even in a complex unknown static environment, the algorithm in this paper can also be used to plan a global optimization path.

关键词： path planning automatic diffluence ant algorithm rolling planning

来源：评论

学校读者我要写书评

暂无评论

Set Covering on the Basis of the ant algorithm 12

Set Covering on the Basis of the ant Algorithm

引用

IEEE East West Design and Test Symposium (EWDTS)

作者： Lebedev, B. K. Lebedev, O. B. Lebedeva, E. M. Southern Fed Univ Coll Automat & Comp Rostov Na Donu Russia

ISBN: (纸本)9781479976300

The set coverings problem using mathematical methods in which principles of natural mechanisms of solution-making are proposed. For compact representation of the set covering solution the matrix of boundary requirements is used. This allowed forming the space of solutions in which frameworks the search process which is based on simulation of adaptive ant colony behavior is organized. In comparison with existing algorithms improvement of results is reached.

关键词： VLSI ant colony optimisation integrated circuit layout VLSI layout design adaptive ant colony algorithm boundary matrix mathematical methods search process set covering problem solution-making natural mechanism solutions space very large scale integration algorithm design and analysis Automation Computer science Educational institutions Layout Search problems Vectors Very large scale integration Search process computational methods algorithm design and analysis tabu search integrated circuit layout Educational institutions computer science layouts ant algorithm Automation ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Robust Design Optimization with Mixed-discrete Variables Based on ant algorithm and Support Vector Machine

Robust Design Optimization with Mixed-discrete Variables Bas...

引用

2nd International Conference on Intelligent Computation Technology and Automation

作者： Ren Pishun Han Huixian Guo Huixin Hunan Mech & Elect Polytech Dept Mech Engn Changsha Hunan Peoples R China Changsha Univ Dept Mech & Elect Engn Changsha Hunan Peoples R China

ISBN: (纸本)9780769538044

The basic ant optimization algorithm is improved by introducing ant colony scatterance and discrete search. In order to solve the optimization problem with mixed-discrete variables, a program of ant algorithm is designed by using MATLAB. Based on the introduce of support vector regression (SVR) which is used to compute the values of nonlinear functions such as fuzzy probability, the computational efficiency of robust design optimization is distinctly improved. An example of robust design optimization with mixed-discrete variables is presented, and it shows that the proposed method is effective in engineering application.

关键词： ant algorithm mixed-discrete variables support vector machine robust design optimization

来源：评论

学校读者我要写书评

暂无评论

The Routing of Reconfigurable Network Based on ant algorithm

The Routing of Reconfigurable Network Based on Ant Algorithm

引用

International Conference on Neural Networks and Signal Processing

作者： Cheng Xuhua Zhao Zhijin Ye Xueyi Hangzhou Dianzi Univ Sch Telecommun Hangzhou 310018 Zhejiang Peoples R China

ISBN: (纸本)9781424423101

Finding the optimum path or routing always is an important and difficult issue in a practical dynamic network. In this paper, a new routing approach that due to multiple requirements in the reconfigurable network is briefly discussed. In order to obtain the optimum path between two nodes, we use the ant algorithm with which the problem can be attached to select the path. Simulation results shows that, especially having considered two factors of cost and delay, the proposed approach can be used to search the routing efficiently by the available nodes and paths provided with the reconstructed network topology even if the network changed.

关键词： routing reconfigurable network ant algorithm

来源：评论

学校读者我要写书评

暂无评论

Intelligent agent enabled genetic ant algorithm for P2P resource discovery

引用

3rd International Workshop on Agents and Peer-to-Peer Computing

作者： Dasgupta, P Univ Nebraska Dept Comp Sci Omaha NE 68182 USA

ISBN: (纸本)3540297553

Rapid resource discovery in P2P networks is a challenging problem because users search for different resources at different times, and, nodes and their resources can vary dynamically as nodes join and leave the network. Traditional resource discovery techniques such as flooding generate enormous amounts of traffic, while improved P2P resource discovery mechanisms such as distributed hash tables(DHT) introduce additional overhead for maintaining content hashes on different nodes. In contrast, self-adaptive systems such as ant algorithms provide a suitable paradigm for controlled dissemination of P2P query messages. In this paper, we describe an evolutionary ant algorithm for rapidly discovering resources in a P2P network.

关键词： peer-to-peer systems software agents ant algorithm adaptive systems genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A Selecting Method of Virtual Enterprise Members Based on ant algorithm

A Selecting Method of Virtual Enterprise Members Based on An...

引用

3rd International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2007)

作者： Wu Shaofei Liu Bin Wuhan Inst Technol Sch Engn & Comp Sci Wuhan Peoples R China Shanxi Univ Sci & Technol Coll Elect & Informat Engn Xian Peoples R China

ISBN: (纸本)9781424413119

In an ever increasingly competitive market environment, virtual enterprise has been gradually becoming a main corporate operating model. More and more enterprises are beginning to form virtual enterprises with other firms. In this way they can also take on the investment risks together. Information system is the very foundation for the virtual enterprises to achieve a highly effective operation, member selecting is the important function of many information systems of virtual enterprise. But presently the related technology concerning the virtual enterprise information system cannot satisfy the needs of the users. This paper researches the member selecting of virtual enterprise, puts forward a selecting method of virtual enterprise group members based upon the ant algorithm, which can be used to deal with the issue of selecting virtual enterprise group members under the condition of multi optimization objects. Then it presents the realization steps of the algorithm and examines some real cases.

关键词： virtual enterprise member selecting ant algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of optimized Trust AODV using ant algorithm

Performance analysis of optimized Trust AODV using ant Algor...

引用

IEEE International Conference on Communications (ICC)

作者： Simaremare, Harris Abouaissa, Abdelhafid Sari, Riri Fitri Lorenz, Pascal Univ Haute Alsace Colmar France Univ Indonesia Depok Indonesia

ISBN: (纸本)9781479920037

A mobile ad hoc network (MANET) is a wireless network with high of mobility, no fixed infrastructure and no central administration. These characteristics make MANET more vulnerable to attack. In ad hoc network, active attack i.e. DOS, and blackhole attack can easily occur. These attacks could decrease the performance of the routing protocol. We have proposed a new trust mechanism to secure the AODV routing protocol called Trust AODV. In this paper, we improve the performance of our proposed secure protocol by using an ant algorithm. ant agent put a positive pheromone when the node is trusted. Path communication is chosen based on pheromone value. We evaluate and compare the performance of proposed protocol before and after using ant algorithm under DOS/DDOS attack. The simulation result shows the performance of proposed protocol increases while using ant algorithm in term of packet delivery ratio and throughput. However, in term of end-to-end delay there is no significant effect to the performance.

关键词： ant algorithm AODV Performance Security Trust mechanism

来源：评论

学校读者我要写书评

暂无评论

Improved ant algorithm Combined with Ecological Theory for Urban Power System Planning

Improved Ant Algorithm Combined with Ecological Theory for U...

引用

International Conference on Artificial Intelligence and Computational Intelligence

作者： Gao Weixin Luo Xianjue Tang Nan Mu Xiangyang Xian Shiyou Univ Sch Elect Engn Xian Peoples R China Xi An Jiao Tong Univ Sch Elect Engn Xian Peoples R China

ISBN: (纸本)9780769538167

we presents a new algorithm for urban power system planning. The new algorithm combines an improved ant algorithm with ecological theory and transforms the urban power system-planning problem into an ecosystem optimization problem. The substation is regarded as an ant nest and the load point is regarded as food in the algorithm presented in this paper. It can simultaneously optimize the substation's size, position, service region and the structure of power network by imitating ecosystem evolvement. The result of calculation shows that the structure of power network is radial, and needs no inspection. Therefore it is easier to be programmed. An example shows that the algorithm is efficient.

关键词： Distribution Network Planning ant algorithm Ecosystem

来源：评论

学校读者我要写书评

暂无评论

Multi-robot cooperation method based on the ant algorithm

Multi-robot cooperation method based on the ant algorithm

引用

IEEE Swarm Intelligence Symposium

作者： Ding, YY He, Y Jiang, JP Zhejiang Univ Coll Elect Engn Hangzhou 310027 Peoples R China

ISBN: (纸本)0780379144

ant algorithm is an optimization algorithm that gained by observing the real ant colonies, and it is very useful in solving difficult optimization problems and distributed control problems. The algorithm is modeled on a key concept called "stigmergy" of the ant societies, which is used in our algorithm to design the cooperation of multi-robots. In an unknown environment, one of the most important problems to the multi-robot system is to decide a task be completed by how many robots. With the concept "stigmergy", the number of the robots cooperating on a task is decided according to the difficulty of the task Given the definition of the "Task Deadlock", an adaptive attenuation factor to eliminate task deadlock is introduced in the cooperation algorithm. Simulations show the effectiveness of the algorithm.

关键词： multi-robot system cooperation ant algorithm task deadlock

来源：评论

学校读者我要写书评

暂无评论

An ant algorithm for Solving the Four-coloring Map Problem

An Ant Algorithm for Solving the Four-coloring Map Problem

引用

9th International Conference on Natural Computation (ICNC)

作者： Chen, Hongshun Zhou, Peng Beijing Normal Univ Sch Informat Technol Zhuhai 519087 Peoples R China

ISBN: (纸本)9781467347143

An undirected graph can demonstrate adjacency relationships among regions in a planar map, and the four-coloring map problem is then converted into a graph vertex coloring problem with constraints. In order to solve the graph vertex coloring problem, an ant algorithm hybridized with a greedy algorithm was proposed. In this algorithm, ants in an ant colony with a given size separately move from one vertex to another according to their transition probability, and a greedy algorithm is used to initialize the proposed algorithm for improving its efficiency. Finally, the improved algorithm was tested by coloring the administrative map of Hunan Province, China, and results show that it is good at finding the optimal value, speed and stability.

关键词： four-coloring problem graph coloring problem ant algorithm combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共24页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：