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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

275 篇 会议
156 篇 期刊文献
6 篇 学位论文

馆藏范围

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

日期分布

学科分类号

379 篇 工学
- 184 篇 计算机科学与技术...
- 120 篇 电气工程
- 79 篇 控制科学与工程
- 60 篇 信息与通信工程
- 32 篇 交通运输工程
- 26 篇 机械工程
- 25 篇 仪器科学与技术
- 25 篇 软件工程
- 18 篇 材料科学与工程（可...
- 15 篇 测绘科学与技术
- 14 篇 土木工程
- 13 篇 石油与天然气工程
- 11 篇 电子科学与技术（可...
- 9 篇 航空宇航科学与技...
- 8 篇 动力工程及工程热...
- 7 篇 化学工程与技术
- 7 篇 生物医学工程（可授...
- 6 篇 水利工程
- 6 篇 地质资源与地质工...
- 6 篇 环境科学与工程（可...
71 篇 理学
- 23 篇 数学
- 15 篇 物理学
- 10 篇 化学
- 9 篇 地理学
- 8 篇 地球物理学
- 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

语言

411 篇 英文
15 篇 其他
10 篇 中文
1 篇 西班牙文

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

共 437 条记录，以下是401-410 订阅

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

详细简洁

排序：

A NEW MINIMAL PATH SELECTION algorithm FOR AUTOMATIC CRACK DETECTION ON PAVEMENT IMAGES

A NEW MINIMAL PATH SELECTION ALGORITHM FOR AUTOMATIC CRACK D...

引用

IEEE International Conference on Image Processing

作者： Rabih Amhaz Sylvie Chambon Jerome Idier Vincent Baltazart L'UNAM Universite IFSTTAR - IRIT INP-ENSEEIHT IFSTTAR - IRIT L'UNAM Universite IRCCyN

This paper proposes a new algorithm for crack detection based on the selection of minimal paths. It takes account of both photometric and geometric characteristics and requires few information a priori. It is validate... 详细信息

ISBN: (纸本)9781479957521

关键词： Crack detection Minimal path dijkstra algorithm Non destructive control Pavement

来源：评论

学校读者我要写书评

暂无评论

Locomotion by Shortest Path and Obstacles Avoidance

Locomotion by Shortest Path and Obstacles Avoidance

引用

IEEE Punecon

作者： Milind Patwardhan Kimaya Kulkarni Apoorva Mahajan Yash Zambre Shreya Killedar E&TC Department Vishwakarma Institute of Technology Pune India

ISBN: (数字)9781728119243

ISBN: (纸本)9781728119250

This paper aims to deliver movement of the robot by finding and traversing the shortest path in the static present grid, using source and destination positions entered by the user. The robot currently requires a grid since it traverses space using line-tracing. Further addition to the functioning - the robot avoids static obstacles which might be present in its path towards destination. A microcontroller (AtMega2560) was used as an interface between the hardware and our software program. The robot used was Firebird V. For line-tracing, infrared LEDs (transmitters) and photodiodes (receivers) present on the robot were used. The popular dijkstra's algorithm had been incorporated in our shortest-path follower code. The language used for programming is AVR.

关键词： Microcontroller dijkstra algorithm Line tracing Source Destination grid destination Microcontrollers shortest path grids Robot dijkstra's algorithm Locomotion Grid automatic voltage regulator

来源：评论

学校读者我要写书评

暂无评论

Commercial Vehicle Supply Chain Network Design Based on 0-1 Planning Model

Commercial Vehicle Supply Chain Network Design Based on 0-1 ...

引用

第十八届分布式计算及其应用国际学术研讨会

作者： Wang Haoyu Song Lei Zhang Hanyu Wang Zhenyu Li Ming Ye Meng Wuhan University of Technology

Proper planning of the commercial vehicle supply chain is conducive to improving work efficiency and reducing transportation *** this paper,the dijkstra algorithm is used to solve the neighboring weight matrix between different *** 0-1 planning model is established by distance,fixed cost and demand,and the optimal total cost scheme is calculated by genetic *** simulated annealing algorithm is used to solve the problem of minimum road damage in the case of a certain increase in total cost,which is convenient for the transportation company to make rational adjustments of the commercial vehicle supply chain network.

关键词： 0-1 planning model dijkstra algorithm genetic algorithm simulated annealing algorithm commercial vehicle supply chain

来源：评论

学校读者我要写书评

暂无评论

A GPS Navigation System Based on the Internet of Things Platform

A GPS Navigation System Based on the Internet of Things Plat...

引用

2011 IEEE 2nd International Conference on Software Engineering and Service Science(ICSESS 2011)

作者： Hong Zhan School of electronic engineering Beijing University of Posts and Telecommunications Beijing, China Zhigang Wen,Yuxin Wu,Junwei Zou and Shan Li School of electronic engineering Beijing University of Posts and Telecommunications Beijing, China

With the development of the society and the changes of the traffic information on the urban road, Optimal path is no longer simply the shortest distance on the geographical location, but also taking into account the real-time traffic information. Meanwhile, with the development of the computer technology, communication technology and geographical information technology, intelligent navigation brings more benefits to people. It can save the trave time and reduce energy consumption. On the other hand, using intelligent navigation, people can avoid roadblock, traffic jams, traffic accidents etc. Intelligent navigation can provide a safer and more reassuring environment. Combining with the Internet of Things, this paper proposes an improved routing algorithm for dynamic traffic navigation based on the Internet of Things platform. GPS will download the real- time traffic information by accessing the built Internet of Things platform, calculate the optimal path precisely, and then provide real-time and more intelligent navigation service for people.

关键词： Internet of Things dijkstra algorithm Optimal Path GPS Navigation System

来源：评论

学校读者我要写书评

暂无评论

A Path Planning Method for Substation Laser Inspection Robot Based on Improved Ant Colony algorithm

A Path Planning Method for Substation Laser Inspection Robot...

引用

2nd International Conference on Computer Engineering,Information Science & Application Technology(ICCIA 2017)

作者： Yan Deng Hongyu Hu Xiaolu Tian Jiake Liu Mingyang Liu Yafei Wang Shandong Luneng Intelligence Technology co. LTD Jiangxi Electric Power Company Lanzhou University

ISBN: (纸本)9781510845008

In order to shorten the inspection path and time-consuming, improve the intelligence degree of the laser inspection robot and apply to the large-scale TSP in the substation, the paper proposes a path planning method based on the improved ant colony algorithm, the navigation method, the walking characteristics, the inspection task and the road environment. This method uses the topological method to model the road environment. The dijkstra algorithm and the improved ant colony algorithm are used to plan the inspection path of the laser inspection robot. In this way, the laser inspection robot can re-plan the new inspection path for the remaining undetected task points after encountering an obstacle, and finally return to the starting point. In this paper, Visual Studio C++ is used to test the improved ant colony algorithm and Greedy algorithm. The results show that the improved ant colony algorithm has obvious advantages in path length and the number of passing points, which can realize that the inspection route of the laser inspection robot is optimal or sub-optimal. At the same time, the dynamic simulation of the method is carried out based on MATLAB. The simulation results show that the method can realize self-real-timely avoid obstacle and re-plan the new inspection route after encountering an obstacle. It can ensure the completion of the inspection task. And the method has good applicability, robustness and high efficiency.

关键词： Laser Inspection Robot Path plan Topology Undirected Graph Ant Colony algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Route Choice Options Based on Lattice Alliance Certification in Wireless Networks

Route Choice Options Based on Lattice Alliance Certification...

引用

2011 International Conference on Advanced Materials and Computer Science(ICAMCS 2011)

作者： ZHANG Qiu-yu JIANG Wen-tao BAO Guang-bin School of computer and communication Lanzhou University of Technology

For the existing certification that ignores trust relationship between inter-domains will lead to the certification failure phenomenon,in the consideration of trust relationship circumstances this paper presents an alliance certification scheme based on the lattice combining dijkstra path search algorithm between the domainsTheoretical analysis shows that dual-traction certification mechanism greatly increases system security,also avoids the single point collapseAccording to calculating the path weight by dijkstra algorithm to find the shortest path in the weighted graph,the scheme can improve the certification efficiency

关键词： cross-domain certification lattice binary tree certification path dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ON THE PERFORMENCE OF DYNAMIC ROUTING algorithm

RESEARCH ON THE PERFORMENCE OF DYNAMIC ROUTING ALGORITHM

引用

2009 International Conference on Machine Learning and Cybernetics(2009机器学习与控制论国际会议)

作者： MING-XIN YANG WEN-DONG GUO BING-TONG WANG School of Economics and Management Hebei University of Science and Technology Shijiazhuang Hebei 0 Shijiazhuang Posts & Telecommunications Technical College Shijiazhuang Hebei 050021 China

On the basis of analyzing static routing algorithm and dynamic routing algorithms, this paper focus on the link state routing of the dynamic routing algorithm, puts forward a more concise routing way in the link state routing. dijkstra routing algorithm is suitable for calculating the shortest path from one router to other routers, but there are more point-to-point links in the computer network, Floyd routing algorithm is more suitable for calculating the shortest distance between two router, and it is more practical in the computer network.

关键词： Routing algorithm dijkstra algorithm Flody algorithm

来源：评论

学校读者我要写书评

暂无评论

Study on Path Planning of Urban Sharing-bike Connecting Rail Transit

Study on Path Planning of Urban Sharing-bike Connecting Rail...

引用

2018 3rd International Conference on Materials Science,Machinery and Energy Engineering(MSMEE 2018)

作者： Chenggong Yu Xiubang Li Xiaoxia Li School of Automobile Chang'an University School of traffic Qinghai Nationalities University

Sharing-bikes are characterized by health, greenness and environmental protection, effectively solving the "last kilometer" problem. It is of great significance to reasonably plan the sharing-bike connecting rail transit routes to meet the traveler's needs, build safe urban traffic travel environment, and guide bicycle travel. Based on the shared bicycle trip data, this paper proposes an optimal paved lane path planning model for a sharing-bike connected rail transit based on traffic network. Based on spatial clustering and improved dijkstra's algorithm, the steps and principles for solving the model are given. The results of the example of Beijing No. 2 Line as a planning example show that this model has the characteristics of convenience of route layout and deployment cost, and has certain feasibility, which enriches the path planning method of bicycle lanes.

关键词： urban traffic path planning Sharing-bikes dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Research of Shortest Path algorithm Based on the Data Structure

Research of Shortest Path Algorithm Based on the Data Struct...

引用

2012 IEEE 3rd International Conference on Software Engineering and Service Science（ICSESS 2012）

作者： Jinhao Lu Department of Computer Science Northeast Petroleum University at Qin Huangdao Qin Huangdao,ChinaChi Dong Petroleum Engineering Institute Northeast Petroleum University Da Qing,China

The shortest path problem based on the data structure has become one of the hot research topics in graph *** the basic theory of solving this problem,dijkstra algorithm has been widely used in engineering *** at the shortcomings of traditional dijkstra algorithm,this paper has proposed an optimization method which has mainly improved the nodes selection of the shortest path and data storage structure and *** comparison and analysis,the improved algorithm has been obtained,which has reduced the storage space,improved the operational efficiency and has a better applicability in the shortest path calculation.

关键词： data structure shortest path dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

The Shortest Path Application of the Logistics System in Production Workshop

The Shortest Path Application of the Logistics System in Pro...

引用

作者： Jiajun Hu Weijie Shang Jian Rong China Tobacco Zhejinag Industrial Co.Ltd China Tobacco Zhejiang Industrial Co.Ltd

It is difficult for traditional logistics mode to meet the market demand. It analyzes the requirement such as the short order cycle, small batch and much batch times. Automated warehousing logistics has constantly get new development and application. Based on the AGV(automatic guided vehicle/AGV), it introduces the warehousing logistics distribution technology, designs the logistics form, establishes an effective storage space model and obtains a suitable road network for AGV run. Based on the single mission requirements, it builds the mathematical model of AGV running at the shortest total distance, analyzes from the methods of single task transfers AGV to multitasking transfers to AGV, applies dijkstra algorithm to solve the warehousing distribution matching problem of AGV with tasks in the system.

关键词： task AGV dijkstra algorithm matches

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：