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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

274 篇 会议
157 篇 期刊文献
6 篇 学位论文

馆藏范围

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

日期分布

学科分类号

379 篇 工学
- 183 篇 计算机科学与技术...
- 119 篇 电气工程
- 79 篇 控制科学与工程
- 59 篇 信息与通信工程
- 32 篇 交通运输工程
- 26 篇 机械工程
- 25 篇 仪器科学与技术
- 25 篇 软件工程
- 18 篇 材料科学与工程（可...
- 16 篇 测绘科学与技术
- 14 篇 土木工程
- 13 篇 石油与天然气工程
- 11 篇 电子科学与技术（可...
- 9 篇 航空宇航科学与技...
- 8 篇 动力工程及工程热...
- 7 篇 化学工程与技术
- 7 篇 环境科学与工程（可...
- 7 篇 生物医学工程（可授...
- 6 篇 水利工程
- 6 篇 地质资源与地质工...
72 篇 理学
- 23 篇 数学
- 15 篇 物理学
- 10 篇 化学
- 9 篇 地理学
- 9 篇 地球物理学
- 7 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 7 篇 工商管理
16 篇 医学
- 8 篇 临床医学
8 篇 经济学
- 8 篇 应用经济学
5 篇 法学
3 篇 农学
2 篇 教育学
2 篇 文学
1 篇 艺术学

主题

437 篇 dijkstra algorit...
38 篇 path planning
34 篇 shortest path
17 篇 graph theory
14 篇 optimization
12 篇 genetic algorith...
10 篇 optimal path
10 篇 shortest path pr...
8 篇 routing
8 篇 a* algorithm
8 篇 route optimizati...
8 篇 wireless sensor ...
5 篇 maklink graph
5 篇 wireless sensor ...
5 篇 navigation
5 篇 optimal path pla...
5 篇 dynamic programm...
5 篇 simulated anneal...
5 篇 ant colony algor...
5 篇 path optimizatio...

机构

4 篇 brno university ...
3 篇 fukuoka inst tec...
3 篇 fukuoka inst tec...
3 篇 univ elect sci &...
3 篇 southwest petr u...
3 篇 school of north ...
2 篇 rajarajeswari co...
2 篇 qatar univ dept ...
2 篇 henan institute ...
2 篇 shenyang institu...
2 篇 democritus univ ...
2 篇 northeastern uni...
2 篇 school of north ...
2 篇 univ elect sci &...
2 篇 wuhan univ techn...
2 篇 beijing univ pos...
2 篇 univ essex sch c...
2 篇 northwestern pol...
2 篇 univ sfax digita...
2 篇 north china elec...

作者

6 篇 uchida kazunori
3 篇 hou xiaorong
3 篇 barolli leonard
3 篇 luo min
2 篇 raj pethuru
2 篇 hakim hela
2 篇 guo shi-ze
2 篇 selvarani r.
2 篇 yunjuan liang
2 篇 ouarzazi jamal
2 篇 yang yang
2 篇 zhang hanyu
2 篇 boujemaa hatem
2 篇 zhang ruifang
2 篇 georgiadi irene
2 篇 dechuan kong
2 篇 ji tianyi
2 篇 luo yaozhi
2 篇 yoo mintaek
2 篇 touati farid

语言

412 篇 英文
14 篇 其他
10 篇 中文
1 篇 西班牙文

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

共 437 条记录，以下是301-310 订阅

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

详细简洁

排序：

PMA Partition Method of Water Distribution Network Combined with Gragh Theory 18th

PMA Partition Method of Water Distribution Network Combined ...

引用

18th International Conference on Water Distribution System Analysis (WDSA)

作者： Gao, Jinliang Yao, Fang Xu, Yongpeng Sun, Guosheng Zheng, Chengzhi Qi, Shihua Cui, Fuyi Harbin Inst Technol Harbin 150090 Heilongjiang Peoples R China Guangdong Holding Ltd Shenzhen 518021 Guangdong Peoples R China

A method are proposed combining PMA partition and graph theory with four parts. Using adaptive Affinity Propagation (AP) clustering algorithm with consideration of economic benefit to preliminarily partition water distribution network(WDN) and reasonably determine the partition number. Calculate the shortest path between the clustering centre and water source by dijkstra algorithm and determine water supply inlet of each region. Establish topology discrete optimization model to determine partition boundary, then applying simulated annealing algorithm to solve the model. Vertically and horizontally combining the partitioned areas to ensure the safety of water supply. This method has been applied to the WDN of Y city to control the pressure for the areas with a certain results. (C) 2016 The Authors. Published by Elsevier Ltd.

关键词： Water distribution network leakage control PMA partition graph theory AP clustering algorithm dijkstra algorithm simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

MULTI-ROBOT ONE-TARGET 3D PATH PLANNING BASED ON IMPROVED BIOINSPIRED NEURAL NETWORK 16

MULTI-ROBOT ONE-TARGET 3D PATH PLANNING BASED ON IMPROVED BI...

引用

16th IEEE International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)

作者： Luo, Min Hou, Xiaorong Yang, Jing Univ Elect Sci & Technol China Sch Automat Engn Chengdu 611731 Peoples R China Southwest Petr Univ Sch Elect Engn & Informat Chengdu 610500 Peoples R China

ISBN: (纸本)9781728142425

3D Path planning for multi-robot one-target pursuit is an interesting topic. Bioinspired neural network is frequently implemented for path planning of multi-robot, and the bioinspired neural network neural activity value computational cost and time cost will increase sharply with the increase of the number of neurons. This paper explores an improved 3D path planning method based on multi-scale map method to reduce the time cost. Combining the multi-scale map method with the dijkstra algorithm, the optimal paths of 3D coarse-scale map of multi-robot one-target can be generated. The weights created from the coarse-scale map are employed to yield the 3D path planning of the fine-scale map for the same terrain. Therefore, this improved bioinspired neural network algorithm has proven the ability to calculate the multi-robot 3D optimal paths. By introducing this multi-scale map method into the multirobot bioinspired neural network algorithm, the time cost and mathematical complexity of the path planning algorithm can be greatly reduced. MATLAB simulation results further reveal the effectiveness and superiority of this method.

关键词： Multi-scale map method multi-robot Bioinspired neural network 3D path planning dijkstra algorithm time cost

来源：评论

学校读者我要写书评

暂无评论

A routing decision algorithm based on the trunk link for smart city 28

A routing decision algorithm based on the trunk link for sma...

引用

28th Chinese Control and Decision Conference, CCDC 2016

作者： Hong, Huo Bao-Ming, Pu Dong-Sheng, Yang Xiang-Ze, Li Shenyang Institute of Computing Technology Chinese Academy of Sciences Shenyang110004 China School of Computer Science and Engineering Northeastern University Shenyang110819 China

ISBN: (纸本)9781467397148

We proposes a novel routing decisions method based on comprehensive trust value to solve the multi-source heterogeneous data routing problem in the smart city. The method combines four parameters-trust value, intensity, nodal pitch and forward capability - to work out information backtrack issue in the routing decisions algorithm. Through the statistical analysis, we obtain indirect trust value and direct trust value and present a comprehensive trust evaluation method. Then, the cluster node selection method is given. Experimental results show that the established trust value model is considerably reliable, and with the increase of cycle number, the trust value gradually tends to 1. In comparison with original algorithm and dijkstra algorithm, this algorithm improves convergence speed largely and is stable when in the information transfer process. When the network topology changes, this algorithm can do fast rerouting. This shows that the algorithm has a significant effect in smart city data routing. © 2016 IEEE.

关键词： dijkstra algorithm Rerouting Smart City Trunk Link Trust Value

来源：评论

学校读者我要写书评

暂无评论

Optimization of Logistics Route Based on dijkstra

Optimization of Logistics Route Based on Dijkstra

引用

2015 6th IEEE International Conference on Software Engineering and Service Science(ICSESS 2015)

作者： Xin Zhang Yan Chen Taoying Li Transportation Management College Dalian Maritime University

In large or medium retail enterprises, the downstream of the supply chain is usually composed by distribution centers or various warehouses. Since the distance of each distribution route is large, so the optimization of path is very important for the cost control and profit maximization of the enterprise. This paper uses dijkstra algorithm to solve the shortest path problem, and uses the method of map labeling, simplifying the solving process Finally through the abstracting model of the problem, and designing of structure and combining with the process oriented C language, the paper realizes this function.

关键词： dijkstra algorithm map labeling optimization of path

来源：评论

学校读者我要写书评

暂无评论

The Method Based On dijkstra Of Multi-directional Ship's Path Planning

The Method Based On Dijkstra Of Multi-directional Ship's Pat...

引用

第32届中国控制与决策会议

作者： Zihui Cheng Huajun Zhang Qin Zhao Automated Institute Wuhan University of Technology

Aiming at the problem of the shortest path's optimization for direct navigation of ships,the dijkstra algorithm search is *** environment of the ship's navigation area was modeled by rasterization and *** the four-direction search,eight-direction search and arbitrary-angle search based on the dijkstra algorithm were improved,and the three search methods were *** experiments and research results show that the improved arbitrary angle search method can best meet the requirement of the shortest direct flight path.

关键词： Path optimization Grid method Puffing process dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Target Searching of Mobile Robots Using Improved A* Searching algorithm

Target Searching of Mobile Robots Using Improved A* Searchin...

引用

2nd International Conference on Mechatronics and Applied Mechanics (ICMAM2012)2nd International Conference on Mechatronics and Applied Mechanics (ICMAM2012)

作者： Chang, C. H. Zou, J. T. Su, K. L. Natl Yunlin Univ Sci & Technol Grad Sch Engn Sci & Technol Yunlin Taiwan Natl Formosa Univ Dept Aeronaut Engn Yunlin Taiwan Natl Yunlin Univ Sci & Technol Dept Elect Engn Taipei Taiwan

ISBN: (纸本)9783037856512

The paper studies motion path planning problem using improved A* searching algorithm, and implements the movement scenario using mobile robot system. Solving the shortest path problem, dijkstra algorithm can finds the shortest path to solve the path searching problem. The searching depth is not applicable in certain circumstances to be a disadvantage. The paper proposed improved A* searching algorithm using the intelligent node judgment method, it not only be able to retain the advantages of the traditional A* algorithm but also improve the shortcomings. It programs the on-time motion path in dynamic environment;it also programs the motion path more closed to the best path. Finally, the paper uses multiple strategies to improve the searching motion path to be the best motion path, and compares with the traditional A* algorithm to reduce the searching time.

关键词： improved A* searching algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficient autonomous vehicle navigation scheme based on LiDAR sensor in vehicular network 45

An efficient autonomous vehicle navigation scheme based on L...

引用

45th Annual IEEE Conference on Local Computer Networks (LCN)

作者： Benelmir, Rima Bitam, Salim Mellouk, Abdelhamid Univ Biskra Dept Comp Sci Biskra Algeria Univ Paris Est Dept Networks & Telecom Creteil France

ISBN: (纸本)9781728171586

Recently, autonomous vehicles navigation (AVN) attracted many researches trying to improve road traffic without the human intervention. One of the main challenges in AVN is allowing a vehicle to discover its moving trajectory with a reduced computational complexity. To cope with this issue, we propose in this paper a new simulated annealing algorithm to discover an optimal trajectory when the vehicle encounters an obstacle using LiDAR perception. The found trajectory is then sent to a roadside unit (RSU), which communicates this discovery to other nodes in the network for further use. During its navigation, the vehicle perceives the environment by a LiDAR sensor to detect an eventual obstacle and launches an optimal path discovery to reach the final destination in a reduced time. The results obtained showed the effectiveness of our proposal to find an optimal route compared to dijkstra algorithm.

关键词： Autonomous Vehicle Navigation LiDAR Simulated Annealing algorithm dijkstra algorithm PiCar-S

来源：评论

学校读者我要写书评

暂无评论

algorithm for Minimum-time Path Based on Virtual Length

Algorithm for Minimum-time Path Based on Virtual Length

引用

2nd International Conference on Biomedical Engineering and Informatics (BMEI)

作者： Huang, Yihu Zhang, Genmin Wang, Jinli Qingdao Univ Sci & Technol Qingdao Peoples R China

ISBN: (纸本)9781424441334

There are only two variables including vehicle speed and the length of path in existing search algorithms for minimum-time path. The model does not include weather and road environment which impact the travel time. So the practical application of the model is not satisfactory. Important variables are considered in this paper, such as length of path, road grade, weather and human activities. We put forward the concept of virtual length of the path, and present the solution of the algorithm. Compared with the present search algorithm, the average travel time is saved by 17.73% according to the simulation result, and it improves the practical value in engineering applications.

关键词： virtual length minimum-time path dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A minimal encirclement algorithm for blockade problem with its application 33

A minimal encirclement algorithm for blockade problem with i...

引用

33rd Chinese Control Conference (CCC)

作者： Ding, Zhaozhen Cai, Chenxiao Xu, Wenkang Nanjing Univ Sci & Technol Sch Automat Nanjing Peoples R China

ISBN: (纸本)9789881563842

In this paper, it is studied a blockade problem about suspect escape with using graph theory. A minimum encirclement generation algorithm is proposed to convert this problem into a matching problem. Then the specific blockade plan is obtained. As the algorithm is a sort of polynomial time algorithm, it can obtain the global optimum in a relative shorter time compared with other algorithms. A series of evaluation criterion and numerical example are finally simulated to measure the effectiveness of proposed the blockade plan.

关键词： Blockade Problem Encirclement Generation algorithm Time Complexity dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

An Optimize Particle Swarm Optimization Routing algorithm for Data Transmission in Cognitive Radio Networks

An Optimize Particle Swarm Optimization Routing Algorithm fo...

引用

10th International Symposium on Electronics and Telecommunications (ISETC)

作者： Simion, Daniel Graur, Adrian Alexandru, Lavric Stefan, Sfichi Mahdi, Ali Haider Stefan Cel Mare Univ Suceava Elect Engn & Telecommun Dept Suceava Romania Tech Univ Ilmenau Integrated Commun Syst Grp Ilmenau Germany

ISBN: (纸本)9781467311762

In this paper it is propose a routing algorithm using PSO (Particle Swarm Optimization). The PSO outperforms the classical dijkstra algorithm in that PSO could handle multi-objective routing problems while the dijkstra cannot. A simulation model was build where PSO is distributed implemented and the optimum route is calculated on each node until destination is reached. This distributed approach gives the proposed algorithm extra avails in that no centralized arbiter is needed. The optimization also considers supporting Quality-of-Service (QoS) to routing in CRNs. It has been shown that algorithm would adapt multi-hop routing according to different QoS requirements, which makes it achievable in future CRNs.

关键词： dijkstra algorithm optimization PSO routes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 27 28 29 30 31 32 33 34 35 36 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：