咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是351-360 订阅
排序:
A Routing Computation Strategy Based on Improved Clustering algorithm
A Routing Computation Strategy Based on Improved Clustering ...
收藏 引用
2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)
作者: Zhao Jian-peng Guo Shi-ze Zheng Kang-feng Hu Yi-xun Dai Fang-fang Beijing Univ Posts & Telecommun Informat Secur Ctr Beijing 100876 Peoples R China Northern Elect Instrument Inst Beijing 100191 Peoples R China
A routing computation strategy based on improved clustering algorithm is proposed in this paper. It uses a clustering algorithm based on K-means and dijkstra (CAKD) in topology partitioning. The routing information of... 详细信息
来源: 评论
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
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 Dijkstr... 详细信息
来源: 评论
The Shortest Path algorithm Based on Petri Net
The Shortest Path Algorithm Based on Petri Net
收藏 引用
2012 IEEE 19th International Conference on Industrial Engineering and Engineering Management(IE&EM 2012)
作者: Yu-jie Zheng Kai-hu Hou Wei-zhen Liao Lin Yang Department of Industrial Engineering Kunming University of Science and Technology
The dijkstra algorithm is the classic algorithm to solve the shortest path problem, but the solving process is relatively complicated. As the visual graphics ability and good computer skills of Petri Net, it is used t... 详细信息
来源: 评论
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 s... 详细信息
来源: 评论
Signal quantization by variation
收藏 引用
INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING 2011年 第12期25卷 1061-1073页
作者: Kaempke, Thomas InMach Intelligente Maschinen GmbH D-89077 Ulm Germany
Real-valued data are quantized according to the magnitude of their fluctuations around regional mean values or around a given, real-valued signal. Quantization does not require any parameter or threshold value except ... 详细信息
来源: 评论
Shortest path problem with uncertain arc lengths
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 2011年 第6期62卷 2591-2600页
作者: Gao, Yuan Tsinghua Univ Dept Math Sci Beijing 100084 Peoples R China
Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution ... 详细信息
来源: 评论
Design of suitable permutations for irregular turbo codes
收藏 引用
ELECTRONICS LETTERS 2011年 第13期47卷 748-U34页
作者: Ben Ismail, D. Kbaier Douillard, C. Kerouedan, S. CNRS UMR 3192 Lab STICC Inst TelecomTechnopole Brestiroise CS 83818 F-29238 Brest 3 France Univ Europeenne Bretagne Bretagne France
Proposed is a method based on the dijkstra's algorithm and an estimation of the distance to search for efficient interleavers, adapted to irregular turbo codes, in order to reduce the flattening effect. Simulation... 详细信息
来源: 评论
An Efficient algorithm to Create a Loop Free Backup Routing Table
收藏 引用
3rd International Conference on Wireless, Mobile Networks, and Applications/1st International Conference on Computer Science, Engineering and Applications
作者: Abujassar, Radwan S. Ghanbari, Mohammed Univ Essex Sch Comp Sci & Elect Engn Colchester CO4 3SQ Essex England
Traditional routing protocols schemes allow traffic to pass via the single shortest path. Pre-computing an alternative aims to route the traffic through it when the primary path goes down. A new algorithm schema has b... 详细信息
来源: 评论
Multi-Modal Transportation Advisor system
Multi-Modal Transportation Advisor system
收藏 引用
2011 IEEE Forum on Integrated and Sustainable Transportation Systems, FISTS 2011
作者: Ferreira, João C. Filipe, Porfirio Silva, Alberto ADEETC - ISEL Lisbon Portugal Inesc-ID Lisbon Portugal
The current work deals with the problem of growing population in the cities and the associated mobility problems. For this problem it is proposed a Multi-Modal Transportation Advisor system, based on the integration f... 详细信息
来源: 评论
Ambulance response modeling using a modified speed-density exponential model
Ambulance response modeling using a modified speed-density e...
收藏 引用
14th International IEEE Conference on Intelligent Transportation Systems (ITSC)
作者: Haas, Olivier C. Coventry Univ Control Theory & Applicat Ctr Coventry W Midlands England
individual ambulance velocity and response time to a single incident. Existing lane based models have been modified by formulating mathematically emergency vehicle capability and behavior in the UK. The model is appli... 详细信息
来源: 评论