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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
156 篇 期刊文献
6 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

436 篇 dijkstra algorit...
38 篇 path planning
34 篇 shortest path
17 篇 graph theory
14 篇 optimization
12 篇 genetic algorith...
10 篇 optimal path
10 篇 shortest path pr...
9 篇 a* algorithm
8 篇 routing
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 篇 英文
14 篇 其他
10 篇 中文
1 篇 西班牙文

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

共 436 条记录，以下是311-320 订阅

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

详细简洁

排序：

algorithms to Find Shortest Paths with Added Constraint on Travel Fuel Consumption for Transportation Networks

Algorithms to Find Shortest Paths with Added Constraint on T...

引用

American-Society-of-Civil-Engineers (ASCE) International Conference on Transportation and Development (ICTD)

作者： Nezafat, Reza Vatani Nguyen, Duc T. Cetin, Mecit Old Dominion Univ CEE Dept 132B KH5215 Hampton Blvd Norfolk VA 23529 USA Old Dominion Univ CEE & MSVE Dept 5215 Hampton Blvd Norfolk VA 23529 USA Old Dominion Univ CEE Dept 135 KH5215 Hampton Blvd Norfolk VA 23529 USA

ISBN: (数字)9780784481547

ISBN: (纸本)9780784481547

In this work, the shortest path (SP) dijkstra algorithm is re-visited and modified so that the modified dijkstra algorithm can perform the task of finding the shortest path (SP) with an added constraint on fuel consumption, which is assumed to be linearly related to the CO2 emissions. For the SP with added constraint problem, the "traditional, classical" dijkstra algorithm is not suitable, thus 4 different algorithms/strategies are proposed, such as (a) finding the k-th successive SP, (b) the lagrange multipliers, (c) linear integer programming (LIP) formulation, and (d) based on using the genetic algorithm (GA). Several small-scale (academic) networks, as well as real-life (large-scale) networks, are used to study the numerical performance of 4 proposed algorithms. Numerical results have indicated that (using reliability and efficiency as first and second criteria, respectively) LIP, k-th successive SP, GA, and Lagrange multipliers can be ranked as 1st, 2nd, 3rd, and 4th, respectively.

关键词： Shortest Paths (SP) Linear Integer Programming k-th Successive SP Lagrange Multipliers Genetic algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A General MIMO Detection Scheme and Its Performance-Complexity Tradeoff

A General MIMO Detection Scheme and Its Performance-Complexi...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Chang, Ronald Y. Chung, Wei-Ho Acad Sinica Res Ctr Informat Technol Innovat Taipei Taiwan

ISBN: (纸本)9781424492688

A unified tree-search detection scheme based on dijkstra's algorithm is developed for MIMO systems. The proposed framework generalizes the original dijkstra's algorithm by allowing the memory usage, detection complexity, and sorting dynamic associated with the algorithm to be customized. By tuning different parameters, desired performance-complexity tradeoffs are attained and a fixed-complexity version can be produced to facilitate hardware implementation. Simulation results demonstrate that the proposed algorithm shows abilities to achieve highly favorable performance-complexity tradeoffs.

关键词： algorithm design and analysis Complexity theory dijkstra algorithm Heuristic algorithms MIMO MIMO communication MIMO systems Measurement Signal processing algorithms Sorting detection complexity general MIMO detection scheme memory usage performance-complexity tradeoff signal detection sorting dynamic tree searching unified tree-search detection

来源：评论

学校读者我要写书评

暂无评论

Calculation of SCARA Manipulator Optimal Path Subject to Constraints

Calculation of SCARA Manipulator Optimal Path Subject to Con...

引用

2nd International Congress of Engineering Mechatronics and Automation (CIIMA)

作者： Pillajo, Carlos Univ Politecn Salesiana Dept Control & Automatizac Quito Ecuador

ISBN: (纸本)9781479924707

The proposed general the problem of optimization for motion planning of articulated SCARA robotic structures, whose trajectories are subject to constraints, the stated objective is to obtain a sequence of collision-free positions that connect an initial configuration with end using search strategies based on heuristics working space, for which we use the space of the configurations. In order to evaluate the performance of this algorithm, we generated, simulated different work environments and the subsequent display of the planned collision-free paths, applied to articulated SCARA robot. To corroborate this work later this algorithm is implemented on an FPGA allowing varying some basic features of the robot.

关键词： Optimal Path SCARA Robot dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Node placement optimization under K-Coverage and K-Connectivity constraints in wireless sensor networks

Node placement optimization under K-Coverage and K-Connectiv...

引用

IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Nguyen Thi Hanh Huynh Thi Thanh Binh Nguyen Quang Huy Nguyen Van Thanh Banh Thi Quynh Mai Hanoi Univ Sci & Technol Hanoi Vietnam Phuong Dong Univ Hanoi Vietnam

ISBN: (纸本)9781665487689

Many wireless sensor networks (WSNs) need to cover targets in their sensor fields and ensure connectivity and fault tolerance to the base station. This is a challenging task when planning the network deployment. Sensors can help extend lifetime but also need to be well positioned to be effectively used. This paper seeks to design an efficient node localization scheme while meeting the requirements of the target coverage and connectivity in the network. The problem is approached in two phases. The first phase solves the K-Coverage constraint, which is a metric closely related to lifetime, using two novel heuristic methods named KGCA and IKGCA. The second phase ensures the connection to the base station using a modified version of dijkstra algorithm. Experimental results show notable improvements in solution quality and running time for the proposed approaches compared to an existing approach to the problem.

关键词： K-Coverage K-Connectivity dijkstra algorithm heuristic algorithm wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Fusion for optimal path recovering in cerebral x-ray angiography

Fusion for optimal path recovering in cerebral x-ray angiogr...

引用

Medical Imaging 2001 Conference

作者： Boldak, C Toumoulin, C Coatrieux, JL Polytech Inst Dept Comp Sci Bialystok Poland

ISBN: (纸本)0819440086

The objective is to extract the most plausible graph of two-dimensional vascular branches (e.g. with respect to some basic vessel features) or, in other words, to find the best pairing of vascular segments forming these branches. The assumption here is that a previous detection has been carried out which provides the vessel centrelines. The method, based on sparse to dense description, has been designed in order to eliminate irrelevant lines and to extract the most important branches. The key feature of the method is the use of data fusion concepts in a simple but efficient way, capable to later integrate possibilistic or fuzzy decisions. It makes use of local fusion decision at each node (vessel forking, crossing or ending), based on intensity, continuity and shape properties. Several criteria have been explored with hierarchically structured features. A global fusion allows multiple optimal paths to be set and further merged in order to derive a final graph. Local and global fusions are applied by traversing the vessel network from the extremities to the root and vice and versa. Segments and branches are defined as objects for any further selection, manipulation and measurements. This method can be used both in pre-operative and intra-operative situations.

关键词： X-ray angiography branch formation data fusion dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Source Placement in a DC Microgrid Considering Line Losses and Cables Weight

Optimal Source Placement in a DC Microgrid Considering Line ...

引用

2023 IEEE PES Innovative Smart Grid Technologies Europe, ISGT EUROPE 2023

作者： Boutros, Fouad Doumiati, Moustapha Olivier, Jean-Christophe Mougharbel, Imad Kanaan, Hadi Y. ESEO 10 Bd Jeanneteau Angers49100 France IREENA Lab UR 4642 France Saint-Joseph University of Beirut Lebanon Univ. Nantes 37 Bd de l’Université France IREENA Lab UR 4642 Saint Nazaire44600 France ETS Montréal Laboratoire Grepci Canada Saint-Joseph University of Beirut Lebanon Faculty of Engineering ESIB Lebanon

ISBN: (纸本)9798350396782

This research paper presents a methodology for optimizing the placement of an electric single source in a DC islanded microgrid mesh network with the aim of minimizing line losses while considering minimal cables weight. The paper utilizes the dijkstra algorithm (a graph algorithm used in Google Maps) to identify the shortest path between a potential source node and all other variable loads in a predefined electric distribution mesh network topology. The resulting optimal placement of sources is ordered based on their corresponding line losses and optimal cables weight. Connected nodes in the mesh network are predefined, but lines optimal resistances are computed by the algorithm. The study only considers active power and provides insights into optimizing the placement of sources in DC microgrid mesh networks. The main contribution of this paper is to rank source node positions from least to highest line losses. The paper also provides a comparison of the mesh networks based on the optimal cables weight used when placing a source at a defined position. The proposed methodology can be useful for system designers and operators seeking to minimize line losses and optimize energy distribution in DC microgrids using a mesh network topology. © 2023 IEEE.

关键词： DC microgrid dijkstra algorithm line losses and cables weight optimization mesh network optimal electric single source placement

来源：评论

学校读者我要写书评

暂无评论

A new routing algorithm under shared-risk-link-groups constraints for optical networks

A new routing algorithm under shared-risk-link-groups constr...

引用

Conference on Asia-Pacific Optical and Wireless Communication (APOC 2002)

作者： Wen, HB Li, LM Sheng, W Univ Elect Sci & Technol China Natl Key Lab Broadband Opt Fiber Transmiss & Comm Chengdu 610054 Peoples R China

ISBN: (纸本)0819446998

This paper investigates the diverse routing in a wavelength division multiplexing (WDM)-based optical network under SRLG-disjoint constraints. In operational optical networks there are a lot of traffic flows within every lightpath. Any failure of one lightpath will lead to a great loss. So we should provide path protection for the working lightpath. The concept of Shared Risk Link Groups (SRLG) is introduced in optical networks by IETF, which is defined as a group of links that share a common risk component whose failure can potentially cause the failure of all the links in the group. This concept groups all of the entities, such as wavelengths and links, etc., that are affected by a single failure. Now when path protection is employed, for any lightpath connection request, we compute two SRLG-disjoint lightpaths, one as working path and the other as protection path. There are some literatures, which propose methods for link-disjoint paths pair or node-disjoint paths pair, but few algorithms for SRLG-disjoint paths pair. The SRLG-disjoint constraints entail the general constraint-based path computation algorithms. Since this problem is an NP-complete problem and there is no algorithm which could be used to solve this path computation in polynomial time. This paper presents a heuristic algorithm, Low-cost Pair of SRLG-Disjoint Paths algorithm (LPSD), to solve this problem. LPSD can compute two SRLG-Disjoint paths simultaneously, and the total cost of the two paths is near optimal. Analysis and simulation are also given out.

关键词： WDM network shared risk link groups (SRLG) K shortest path selection algorithm dijkstra algorithm Low-cost pair of SRLG-Disjoint paths algorithm (LPSD)

来源：评论

学校读者我要写书评

暂无评论

A more realistic approach for electric power distribution networks design that considers existing electric infrastructure and geographic constraints

A more realistic approach for electric power distribution ne...

引用

2020 IEEE Andescon Conference

作者： Vasquez-Miranda, Paul F. Vasquez-Villarruel, Ramiro M. Escuela Politec Nacl Dept Elect Energy Quito Ecuador Escuela Politec Nacl Dept Elect Energy Ibarra Ecuador

ISBN: (数字)9781728193656

ISBN: (纸本)9781728193656

Due to its considerable impact on the distribution systems' operative efficiency, the technical losses of electric energy are a fundamental parameter to be optimized during the design of the grids. Unfortunately, in practice, this task is generally made without facing the problem as a minimization of the total involved costs. In addition, the proposed methods for coping with this task actually are theoretical. Indeed, they do not consider that the circuit routes in most cases are constrained e.g., by rivers, parks, avenues, streets, sights, etcetera. In this paper, a novel routes-constrained clustering-based methodology is proposed with the aim of determining, without any assessment of operative costs, not only the optimal location of transformers but also the optimal -and feasible- paths for their secondary circuits. With illustrative purposes, a uniform distribution of clients' demand along the study area is assumed. For the sake of going deeper into this research topic, the authors are currently developing an improved version of this methodology, which could be applied to actual Electric Power Distribution Networks (EPDN), by dabbling into the digraphs and evolutionary algorithms application.

关键词： circuits design dijkstra algorithm efficiency electric power distribution k-medoids least-cost routing location of transformers losses optimization

来源：评论

学校读者我要写书评

暂无评论

On shortest paths and sorting

On shortest paths and sorting

引用

1972 ACM Annual Conference/Annual Meeting, ACM 1972

作者： Johnson, Ellis L. IBM United States

In finding shortest paths, the operation of finding, successively, a minimum from a list of numbers may require more work than the remainder of the algorithm. It is shown how algorithms from sorting literature can be used to accomplish this part of the shortest path algorithm. Bounds on the largest possible amount of work are established, and results of a computational study are reported. © Proceedings of the ACM Annual Conference, ACM 1972. All rights reserved.

关键词： dijkstra algorithm Shortest paths Treesort

来源：评论

学校读者我要写书评

暂无评论

UAV Track Planning Based on IRRT algorithm 11

UAV Track Planning Based on IRRT Algorithm

引用

11th Joint International Information Technology and Artificial Intelligence Conference, ITAIC 2023

作者： Jiao, Jian Ji, Yuanfa Sun, Xiyan Wu, Jianhui Liang, Weibin Information and Communication School Guilin University of Electronic Technology Guilin China

ISBN: (纸本)9798350333664

To overcome the problems of low search efficiency, many redundant points and large turning angle in the track planning process of unmanned aerial vehicle (UAV) with Rapidly-exploring Random Trees (RRT) algorithm, This paper presents an Improved Rapidly-exploring Random Trees (IRRT) algorithm, First, the target probability sampling method is used to reduce the number of invalid sampling points;Secondly, the strategy of target oriented expansion is used to generate new nodes to enhance the orientation of the target;Then, dijkstra algorithm is used to optimize the searched feasible path, and the redundant points in the track are removed to obtain a shortest track;Finally, the Bezier curve is used to smooth the shortest track and smooth the larger corner in the shortest track to get a track that meets the kinematic flight of UAV, In simple environment, narrow passage environment and a large number of complex irregular obstacles, Several experiments were conducted in simple environment, narrow channel environment and a large number of complex irregular obstacles, the results show that the IRRT algorithm performs better than the basic RRT algorithm in terms of node utilization, running time and track length, thus verifying the effectiveness of the algorithm. © 2023 IEEE.

关键词： Bezier curve dijkstra algorithm RRT algorithm target extensions track planning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：