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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

The Hybrid Approach for Large Scale Network Access and Querying

The Hybrid Approach for Large Scale Network Access and Query...

引用

Conference on Geospatial InfoFusion II

作者： Xing, Songhua Liu, Xuan Hampapur, Arun IBM TJ Waston Res Ctr Yorktown Hts NY USA

ISBN: (纸本)9780819490742

Geospatially querying and analyzing large high-resolution spatial networks is critical to most of defense and security applications to support military intelligence. However, the majority of existing solutions either store the entire network in memory, which is not scalable, or adopt a disk-based network representation (i.e., SNDB), where routing and spatial queries may incur high I/O overhead and hence are inefficient. In this paper, we present a flexible architecture for large spatial network storage using quadtree. In particular, this hybrid approach preserves network connectivity and proximity within each partition for local search while enabling heuristics to minimize the I/O overhead for queries of large scale. We further develop efficient algorithms to process spatial queries based on this hybrid storage schema.

关键词： Hybrid Approach Network Partition dijkstra algorithm Quadtree

来源：评论

学校读者我要写书评

暂无评论

Multi-depots distribution problem study based on rich network road model

Multi-depots distribution problem study based on rich networ...

引用

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

作者： Chunlong Yao Guijun Zhang Beijin Zhang Siheng Zhong College of Information Engineering Zhejiang University of Technology

ISBN: (纸本)9781467355339

The multi-depots distribution logistic is a particular combination of transportation and routing problems, in which items that have to be loaded into different customers within vehicles, and then delivered with minimum cost. In this paper, a model is built firstly and the weights between the target nodes are acquired based on actual network road by branch-and-cut and dijkstra algorithms;Next, the idea of the evolutionary tree classification is used to solve the nonlinear cost variables in the distribution model. Extensive computational results show that the proposed algorithm are capable of solving to optimality for a large number of small-size instances, and consistently outperform previous algorithms from the literature on large-size and real-world instances.

关键词： rich network model dijkstra algorithm linear programming path optimal time optimal

来源：评论

学校读者我要写书评

暂无评论

The Problem of Reserved-lane for Hazardous Chemicals Transportation and Heuristic algorithm

The Problem of Reserved-lane for Hazardous Chemicals Transpo...

引用

International Conference on Engineering Technology and Application (ICETA)

作者： Li, Fuqing Long, Chi Wu, Naiqi Guangdong Univ Technol Sch Electromech Engn Guangzhou Guangdong Peoples R China Guangdong Univ Finance Dept Comp Sci Guangzhou Guangdong Peoples R China

Hazardous chemicals transportation requires a high-level of security assurance. It is an effective transport strategy that reserved-lanes are set in a transportation route to avoid accidents such as rear-end collision and crash. However, other vehicles will be inevitably influenced if a lane is set as the reserved-lane. Thus, how to minimize the influence by setting the reserved-lane becomes a problem needed to be studied. The mathematical programming model of the reserved-lane setting for hazardous chemicals transportation is established in this paper. According to the characteristics of the problem, the heuristic algorithm based on dijkstra algorithm is proposed. This algorithm is a simple and intelligible, satisfactory solution that can be obtained in polynomials.

关键词： hazardous chemicals transportation problem of reserved-lane dijkstra algorithm heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

The comparison of four UAV path planning algorithms based on geometry search algorithm 9

The comparison of four UAV path planning algorithms based on...

引用

9th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)

作者： He, ZeFang Zhao, Long Beihang Univ Sch Automat Sci & Elect Engn Beijing Peoples R China Beihang Univ Sci & Technol Aircraft Control Lab Beijing Peoples R China

ISBN: (纸本)9781538630228

The comparative study of four practical three-dimensional (3D) path planning algorithm based on geometry search is proceeded in this paper, the four algorithms include dijkstra algorithm, Floyd algorithm, A* algorithm and Ant colony algorithm. In four algorithms, the working environments of Unmanned Aerial Vehicle (UAV) are all modeled using grid map method and UAV three-dimensional paths are all obtained by amending two-dimensional paths with the terrain following algorithm. In addition, a perpendicular approach is used to choose the key path node during UAV path planning. In this paper, online real-time path planning abilities of the four algorithms are compared from the two aspects of the run time and the path length. Simulation results show that the four algorithms can all handle fixed threats and sudden threats, and their planning time are short;but synthetically considering the run time, complexity and path length of the four algorithms, dijkstra algorithm is in turn better than Floyd algorithm, A* algorithm and Ant colony algorithm.

关键词： UAV Path planning dijkstra algorithm Floyd algorithm A* algorithm Ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimization of Evacuation Path Decision with BIM and Psychological Support 29

Optimization of Evacuation Path Decision with BIM and Psycho...

引用

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

作者： Ting Wang Jia Wang Beijing University of Civil Engineering and Architecture Institute of electrical and information engineering

ISBN: (纸本)9781509046584

When people pass through a narrow passage,once the perceived disaster will cause the crowd to generate pressure,to promote their competitive behavior,which lead to disorder and *** is a very serious threat to the evacuation rate and export efficiency of the *** to optimize the crowd's guidance after taking these effects is an important *** on the advanced micro-pedestrian model and simulation,this paper establishes a new network flow *** the large and complex geometric layout of the infrastructure,the computer-aided approach can make the decision more accurate and efficient,We combined network analysis with building information modeling(BIM) to facilitate the decision making for response *** the geometric and topological relationships of the building from the BIM model to construct graph theory and find *** the same time,evacuation behavior of the crowd is supported by psychological discovery and simulation ***,smoke and psychological factors can enhance the desire of the crows to escape-the desired flow *** the desire flow exceeds the capacity of the passage will be disorder and blocked,causing the crowd flow in a non-linear and random way sharp *** order to efficiently guide the crowd,based on the group to reduce the complexity of the operation and reflection of psychological discovery "divide and rule" method ***,when the crowd is moving while the fire is spreading over time,such guidance is problematic because some of the exports may be overcrowded or blocked by fire and *** optimization techniques are then used to find efficient evacuation routes.A large number of results show that our approach can continually update the guidance in the event of an important change in the form of emergency,and our approach can help evacuate people to achieve greater evacuation efficiency compared to recent egress methods.

关键词： Blocking Effect Psychological Characteristics BIM Expected Flow Rate dijkstra algorithm Markov Decision

来源：评论

学校读者我要写书评

暂无评论

Start-up Sequence of Generators in Power System Restoration Avoiding The Backtracking algorithm

Start-up Sequence of Generators in Power System Restoration ...

引用

General Meeting of the IEEE-Power-and-Energy-Society (PES)

作者： Liu, Chongru Wu, Minhao Deng, Yingsong North China Elect Power Univ State Key Lab Alternate Elect Power Syst Renewabl Beijing Peoples R China

ISBN: (纸本)9781479913039

Generator start-up sequence is critical to power system restoration. A new algorithm to optimize the start-up sequence of generators based on dijkstra method is proposed in this paper. First, a combined weight is proposed for the dijkstra method to balance various optimization objects. Based on the modified weights, a priority index considering the branch weight, generator start-up requirement and ramping rate is proposed to optimize the generator start-up sequence. Second, we analyze the backtracking algorithm in detail and found its limitation and disadvantages, which leads a large amount of calculation and start-up failure. A new algorithm to calculate the start-up sequence is proposed. It can avoid the repetition calculation of dijkstra and reduce the computation cost by avoiding backtracking. Finally, the IEEE 30-Bus system and Guangdong power grid system are used to validate the proposed algorithm. Simulation results show that the proposed method is efficiency and it can decrease the restoration time significantly.

关键词： power system restoration generator start-up sequencing dijkstra algorithm priority index avoid backtracking

来源：评论

学校读者我要写书评

暂无评论

Optimal Modeling of Intelligent Guidance Charging for Urban Areas Electric Vehicles 5

Optimal Modeling of Intelligent Guidance Charging for Urban ...

引用

5th IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Gao Hui Yu Xiaohui Nanjing Univ Posts & Telecommun Nanjing 210023 Jiangsu Peoples R China

ISBN: (纸本)9781538660058

Aiming at the problem of electric vehicle (EV) charging path selection under different road traffic conditions, an optimal charging navigation strategy for electric vehicle is proposed under the influence of traffic information. This strategy can make the electric car charging to get the best service in the shortest time;on this basis, a charging path guidance model is established, which takes full account of the time of electric vehicle driving path, the waiting time of charging station and the shortest charging time of electric vehicle charging and the shortest charging path as the objective function.. Based on dijkstra algorithm, the experimental results show that the charging path planning strategy of the electric vehicle can plan reasonable and effective charging routes according to different road conditions. Compared with the traditional charging path planning strategy, this method can effectively reduce the total time cost, the total distance cost and improve the convenience of the user's travel.

关键词： Electric vehicle Charging path planning Road condition information dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic Cluster Based Energy Controlled Routing In Wireless Sensor Networks

Dynamic Cluster Based Energy Controlled Routing In Wireless ...

引用

International Conference on Information Communication and Embedded Systems (ICICES)

作者： Shalma, H. Rajesh, R. Adhiparasakthi Engn Coll Melmaruvathur India

ISBN: (纸本)9781479938346

Fault tolerance has been identified as key challenges in the design and operations of Wireless Sensor Network (WSNs). Failures are inevitable in wireless sensor networks due to inhospitable environment and unattended deployment. Therefore, it is necessary to detect the networks for recovery from the failure to sustain it. WSNs are self-organized using clustering algorithms to conserve energy. The sensor nodes are organized in several small clusters where there are cluster heads in each cluster. These CHs (Cluster Heads) gather data from their local clusters aggregate them & send them to the base station with shortest distance as a forwarding metric using dijkstra algorithm. The proposed scheme is supposed to be an efficient fault detection and recovery mechanism to make the network fault-tolerant and achieve reliability, latency and energy efficiency. Performance analysis and evaluation will be made using several scenarios of wireless sensor networks.

关键词： Energy Efficiency Fault tolerance dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Combined Design of Localization and Routing

Combined Design of Localization and Routing

引用

7th International Conference on MEMS, NANO and Smart Systems (ICMENS 2011)

作者： Li, Caixia Wang, Naibo Cao, Qiying Liu, Honggang Zhou, Xinhua Donghua Univ Coll Informat Sci & Technol Shanghai Peoples R China 50th Res Inst China Elect Technol Grp Corp Shanghai Peoples R China IBM Investment Co Ltd Shanghai Peoples R China

ISBN: (纸本)9783037853122

Nodes self-localization and routing are two main research issues in wireless sensor networks. There are quite a few publications about sensor network localization or routing protocols, but seldom person combines them in their research work. In this paper, we combine a novel TOA location technique and a new centralized energy-efficient routing protocol. The performance of the combination is then simulated by software. Simulation results show that the routing based on the positions got by our location algorithm is as good as the routing based on true positions and can afford most application demands.

关键词： wireless sensor networks energy-efficient constrained optimization multiplier method dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A Customised Assessment Tool Based on Cellular Automata for the Visit-Ability of an Urban Environment 14th

A Customised Assessment Tool Based on Cellular Automata for ...

引用

14th International Conference on Cellular Automata for Research and Industry (ACRI)

作者： Georgiadi, Irene Trunfio, Giuseppe A. Georgoudas, Ioakeim G. Sirakoulis, Georgios Ch. Democritus Univ Thrace Dept Elect & Comp Engn GR-67100 Xanthi Greece Univ Sassari Dept Architecture Planning & Design Piazza Duomo 6 I-07041 Alghero SS Italy

ISBN: (纸本)9783030694791;9783030694807

This study copes with the problem of finding the optimal route that a pedestrian could follow in order to move into an urban environment taking into consideration various criteria and possible points of interest, either objective nor subjective. For this purpose, an appropriate computational model has been designed, based on Cellular Automata (CA) that responds taking into consideration the walkability of the urban area under study. The latter feature encompasses a variety of qualitative parameters in regard to the pedestrian mobility. Thus, this model aims at enforcing more sustainable transport approaches, such as walking. In order to evaluate the functionality of the proposed model, an initial application is carried out in the city of Xanthi, North-East Greece, in order to verify the plausibility and completeness of the proposed routes in different scenarios.

关键词： Crowd modelling Cellular Automata Walkability dijkstra algorithm Simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：