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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是251-260 订阅

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

详细简洁

排序：

On an Efficient and Effective Intelligent Transportation System (ITS) Using Field and Simulation Data

On an Efficient and Effective Intelligent Transportation Sys...

引用

Conference on Multisensor, Multisource Information Fusion - Architectures, algorithms, and Applications

作者： Ekedebe, Nnanna Chen, Zhijiang Xu, Guobin Lu, Chao Yu, Wei Towson Univ Dept Comp & Informat Sci Towson MD 21252 USA

ISBN: (纸本)9781628410587

Intelligent transportation system (ITS) applications are expected to provide a more efficient, effective, reliable, and safe driving experience, which can minimize road traffic congestion resulting in a better traffic flow management. To efficiently manage traffic flows, in this paper, we compare the effectiveness of two well-known vehicle routing algorithms: the dijkstra's shortest path algorithm and the A* (Astar) algorithm in terms of the total travel time and the travel distance. To this end, we built a generic ITS test-bed and created several real-world driving scenarios using field and simulation data to evaluate the performance of these two routing algorithms. The dataset used in our simulation is six weeks traffic volume data from 08/01/2012 to 09/27/2012 in the Maryland (MD)/Washington DC and Virginia (VA) area. Our simulation data shows that an increase in network size results in scalability problems as the efficiency and effectiveness of these algorithms diminishes in larger road networks with greater traffic volume densities, flow rates, and congested conditions. In addition, the imprecision of the road network increases as the network size and the traffic volume density increases. Our study shows that the ability of these vehicular routing algorithms to adaptively route traffic depends on the size and type of road networks, and the current roadway conditions.

关键词： Intelligent transportation system vehicular ad hoc networks vehicle-to-vehicle, and vehicle-to-infrastructure communications astar algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved Dynamic Double Mutation Particle Swarm Optimization for Mobile Robot Path Planning 28

Improved Dynamic Double Mutation Particle Swarm Optimization...

引用

28th Chinese Control and Decision Conference

作者： Liao, Linling Cai, Xiushan Huang, Huadong Liu, Yanhong Zhejiang Normal Univ Coll Math Phys & Informat Engn Jinhua 321004 Peoples R China Zhengzhou Univ Sch Elect Engn Zhengzhou 450001 Peoples R China

ISBN: (纸本)9781467397148

This paper presents a new path planning approach, in which the MAKLINK graph is constructed to describe the complex environment of the mobile robot, the enumeration method ideas into dijkstra algorithm is used to obtain the shortest path, and the dynamic double mutation particle swarm optimization algorithm is adopted to get the optimal path. Finally, simulation results are used to illustrate the validity of the proposed method.

关键词： Double mutation particle swarm path planning MAKLINK graph enumeration method dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

RE²R-Reliable Energy Efficient Routing for UWSNs

引用

International Congress on Information and Communication Technology (ICICT)

作者： Gulista, Khan Kumar, Gola Kamal Rahul, Rathore Teerthanker Mahaveer Univ Dept Comp Sci & Engn Moradabad India

ISBN: (纸本)9789811007552;9789811007545

Wireless sensor networks are used in each and every area of our daily life. It helps us in our life in a straightforward and cost-effective manner. WSNs are usually deployed at unreachable places to collect information about surroundings. As we know three-fourths of the earth is covered with water. So, for information underwater, we need underwater sensor networks. Compared to earthy networks underwater, sensor networks have several limitations of low bandwidth, high propagation delay, and low transmission power. Somewhat similar to earthy sensor nodes, a crucial problem with UWSNs is finding an efficient route between a source and a destination. We reviewed several routing algorithms based on location and locationless algorithms and protocols and we came to know of the several challenges existing in designing energy efficient routing protocols. Considering the several challenges overall, we tried to find a reliable and energy efficient routing protocol for under water sensor networks. Through simulation study using NS-2 simulator, we showed a significant improvement in terms of data delivery ratio, node dead ratio, and energy consumption.

关键词： UWSNs Routing Energy consumption dijkstra algorithm Network lifetime

来源：评论

学校读者我要写书评

暂无评论

ACO for solving a Multimodal Transport Problems using a transfer graph model

ACO for solving a Multimodal Transport Problems using a tran...

引用

International Conference on Computers and Industrial Engineering (CIE39)

作者： Hedi, Ayed Habbas, Zineb Khadraoui, Djamel Univ Paul Verlaine Metz Metz France CRP Henri Tudor Esch Sur Alzette Luxembourg

ISBN: (纸本)9781424441358

This paper proposes an algorithm based on a transfer graph model to compute a Multimodal Shortest Path (MSP) between a given source node s and a destination node d. The first step of this algorithm consists of computing a database saving a large part of necessary data to provide a response to a user itinerary request. Whe show in this paper that using Ant Colony Optimization metaheuristic (ACO) to compute this database, reduces considerably the memory space complexity comparing to the Dijskstra algorithm.

关键词： Multimodal transport transfer graph Shortest Path Problem Time dependent network problem dijkstra algorithm ACO

来源：评论

学校读者我要写书评

暂无评论

The UAV dynamic path planning algorithm research based on Voronoi diagram

The UAV dynamic path planning algorithm research based on Vo...

引用

26th Chinese Control and Decision Conference (CCDC)

作者： Chen, Xia Chen, Xiangmin Shen Yang Aerosp Univ Shenyang 110136 Peoples R China

ISBN: (纸本)9781479937066

According to the flight path planning problem in dynamic environment, this paper gives a method of analysis. First, the radar threat field based on Voronoi diagram is created, and the track performance indicators established based on radar threat cost and fuel cost. Then the dijkstra algorithm was improved, and the algorithm is used for path planning in dynamic environment.. Finally, the simulation experiment is made, the result of simulation shows that the improved algorithm can achieve real-time tracking of moving targets, so the effectiveness of the algorithm is be verified.

关键词： UAV Voronoi diagram dijkstra algorithm Moving target Dynamic path planning

来源：评论

学校读者我要写书评

暂无评论

Application-Oriented Bandwidth and Latency Aware Routing with OpenFlow Network 6

Application-Oriented Bandwidth and Latency Aware Routing wit...

引用

6th IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

作者： U-chupala, Pongsakorn Ichikawa, Kohei Iida, Hajimu Kessaraphong, Nawawit Uthayopas, Putchong Date, Susumu Abe, Hirotake Yamanaka, Hiroaki Kawai, Eiji Nara Inst Sci & Technol Nara Japan Kasetsart Univ Bangkok Thailand Osaka Univ Suita Osaka Japan Univ Tsukuba Tsukuba Ibaraki Japan Natl Inst Informat & Commun Technol Tokyo Japan

ISBN: (纸本)9781479940936

Bandwidth and latency are two major factors that contribute the most to network application performance. Between each pair of switches in a network, there may be multiple paths connecting them. Each path has different properties because of multiple factors. Traditional shortest-path routing does not take this knowledge into consideration and may result in sub-optimal performance of applications and underutilization of network. We proposed a concept of "bandwidth and latency aware routing". The idea is that we could improve overall performance of the network by separating application into bandwidth-oriented and latency-oriented application and allocate different route for each type of application accordingly. We also proposed a design of this network system implemented using OpenFlow. Routes are calculated from monitored information using dijkstra algorithm and its variation. To support our design, we show a use case in which our design performs better than traditional routing as well as evaluation results.

关键词： telecommunication network routing dijkstra algorithm OpenFlow network application-oriented bandwidth bandwidth aware routing bandwidth-oriented application latency aware routing latency-oriented application Bandwidth Benchmark testing Control systems Electronic mail Monitoring Routing Virtual machining

来源：评论

学校读者我要写书评

暂无评论

A Path Planning Method of Wireless Sensor Networks Based on Service Priority 13

A Path Planning Method of Wireless Sensor Networks Based on ...

引用

13th International Conference on Network and Service Management (CNSM)

作者： Li, Peng Xu, Siya Sun, Kang Qiu, Xuesong Qi, Feng Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China

ISBN: (纸本)9783901882982

Life-time represents the effective survival time of network, which is significant when measuring the performance of wireless sensor networks (WSNs). Therefore, it is so important to extend network life-time by planning appropriate path based on energy consumption and remaining energy of wireless sensors. In this paper, a path planning method of WSNs based on service priority is proposed, and a customized dijkstra algorithm is used to solve this problem. This method minimizes the total energy consumption of network while balancing remaining energy of all nodes in network, and through the sacrifice of network delay in exchange for extension of life-time. The simulation results show that our method not only prolongs network life-time compared to shortest-path algorithm but also improves network reliability.

关键词： WSNs service priority path planning dijkstra algorithm load balancing

来源：评论

学校读者我要写书评

暂无评论

AN INDOOR ROUTE PLANNING METHOD WITH ENVIRONMENT AWARENESS 38

AN INDOOR ROUTE PLANNING METHOD WITH ENVIRONMENT AWARENESS

引用

38th IEEE International Geoscience and Remote Sensing Symposium (IGARSS)

作者： Zhou, Yan Chen, Hong Huang, Yueying Luo, Yunxin Zhang, Yeting Xie, Xiao UESTC Sch Resources & Environm Chengdu Sichuan Peoples R China UESTC Big Data Res Ctr Inst Remote Sensing Big Data Chengdu Sichuan Peoples R China Wuhan Univ State Key Lab Informat Engn Surveying Mapping & R Wuhan Hubei Peoples R China Chinese Acad Sci Inst Appl Ecol Res Ctr Ind Ecol & Sustainabil Shenyang Liaoning Peoples R China

ISBN: (纸本)9781538671504

Aiming at satisfying the users' navigation requirements in complex indoor environments, an indoor route planning method with environment awareness is proposed in this paper. Considering the accessibility, simplicity and comfortable experience of user's navigation, the paper first describes the modeling method of indoor navigation network and defines the expressions of indoor environment semantics. And then a navigation cost function is presented, which includes environment semantics such as path complexity, crowded degree and blocking events into indoor navigation network model. Finally, this paper proposes an optimal indoor route planning method by introducing the navigation cost function and environment semantics into traditional dijkstra algorithm. The experimental results show that the proposed method can effectively enhance the user's comfort experience in indoor navigation.

关键词： Environment semantics Indoor route planning dijkstra algorithm Indoor navigation

来源：评论

学校读者我要写书评

暂无评论

Hybrid Dynamic Route Planners 18

Hybrid Dynamic Route Planners

引用

19th Bulgarian International Conference on Computer Systems and Technologies (CompSysTech)

作者： Rothkrantz, Leon Czech Tech Univ Fac Transport Prague Czech Republic

ISBN: (纸本)9781450364256

In most European countries, websites are available with route planners and real time information about incidents and expected delay on the highways. These websites enable car drivers to plan their route from start to destination. On their way, they can use route planners on their smart phone or oilier devices. Recent route planners take care of incidents on the roads. However, none of these planners takes care of the future. In this paper, we present a route planner integrating information from experts in the traffic centers and a route planner based on a dynamic version of the dijkstra algorithm.

关键词： Dynamic route planning dijkstra algorithm incident management

来源：评论

学校读者我要写书评

暂无评论

Robust Visual Place Recognition Based on Context Information 1

Robust Visual Place Recognition Based on Context Information

引用

1st IFAC Workshop on Robot Control (WROCO)

作者： Dai, Deyun Chen, Zonghai Wang, Jikai Bao, Peng Zhao, Hao Univ Sci & Technol China Dept Automat Hefei Anhui Peoples R China

In large-scale and long-term visual SLAM, robust place recognition is essential for building a global consistent map. However, sensor viewpoints and environmental condition changes, including lighting, weather, and seasons, bring a huge challenge to place recognition. We propose a place recognition algorithm based on CNN features and graph model. Firstly, CNN features of images are extracted though an AlexNet network with migration characteristics, and N-nearest neighbor image descriptors of the current image descriptor are found by approximate nearest neighbor searching. Then, according to the difference between descriptors, a weighted directed acyclic graph (weighted DAG) model which describes a cost of context matching between images is established. Finally, a candidate matching sequence with minimum cost on this model is achieved by using dijkstra algorithm. Compared with SeqCNNSLAM and Fast-SeqSLAM, the experimental results demonstrate higher recognition accuracy and robustness of our algorithm. Copyright (C) 2019. The Authors. Published by Elsevier Ltd. All rights reserved.

关键词： place recognition CNN features weighted DAG dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：