咨询与建议

限定检索结果

文献类型

  • 45 篇 期刊文献
  • 41 篇 会议
  • 2 篇 学位论文
  • 1 册 图书

馆藏范围

  • 89 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 66 篇 工学
    • 25 篇 计算机科学与技术...
    • 17 篇 航空宇航科学与技...
    • 12 篇 电气工程
    • 11 篇 机械工程
    • 9 篇 仪器科学与技术
    • 6 篇 信息与通信工程
    • 5 篇 电子科学与技术(可...
    • 5 篇 控制科学与工程
    • 4 篇 交通运输工程
    • 3 篇 土木工程
    • 3 篇 石油与天然气工程
    • 3 篇 软件工程
    • 2 篇 力学(可授工学、理...
    • 2 篇 公安技术
    • 1 篇 建筑学
    • 1 篇 水利工程
    • 1 篇 测绘科学与技术
    • 1 篇 船舶与海洋工程
    • 1 篇 农业工程
    • 1 篇 生物工程
  • 25 篇 管理学
    • 24 篇 管理科学与工程(可...
    • 1 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 18 篇 理学
    • 11 篇 数学
    • 3 篇 物理学
    • 2 篇 地理学
    • 1 篇 天文学
  • 2 篇 经济学
    • 1 篇 理论经济学
    • 1 篇 应用经济学
  • 2 篇 农学
    • 2 篇 作物学
  • 1 篇 军事学

主题

  • 89 篇 shortest path al...
  • 13 篇 shortest path
  • 7 篇 algorithms
  • 5 篇 motion planning
  • 5 篇 airspace
  • 4 篇 parallel algorit...
  • 4 篇 mobile ad hoc ne...
  • 4 篇 graph algorithms
  • 4 篇 path planning
  • 4 篇 network routing
  • 4 篇 federal aviation...
  • 4 篇 routing algorith...
  • 4 篇 transportation
  • 4 篇 trajectory optim...
  • 3 篇 global positioni...
  • 3 篇 shortest path pr...
  • 3 篇 planning
  • 3 篇 numerical simula...
  • 3 篇 global positioni...
  • 3 篇 air traffic mana...

机构

  • 3 篇 indian inst tech...
  • 2 篇 chongqing univ t...
  • 2 篇 univ calif santa...
  • 2 篇 arizona state un...
  • 1 篇 ist austria klos...
  • 1 篇 handson syst ltd...
  • 1 篇 ibm res india ne...
  • 1 篇 cnr res area i-5...
  • 1 篇 cna corp ctr dat...
  • 1 篇 univ cote azur c...
  • 1 篇 univ michigan an...
  • 1 篇 ohio state univ ...
  • 1 篇 vit univ embedde...
  • 1 篇 china electric p...
  • 1 篇 west bengal univ...
  • 1 篇 ibm t j watson r...
  • 1 篇 department of co...
  • 1 篇 ube national col...
  • 1 篇 cardiff univ sch...
  • 1 篇 delft univ techn...

作者

  • 3 篇 ghosh satadal
  • 3 篇 sedeno-noda anto...
  • 3 篇 sridhar banavar
  • 2 篇 chung chin-wan
  • 2 篇 ying lei
  • 2 篇 wang weichang
  • 2 篇 zinage vrushabh ...
  • 2 篇 liu yongming
  • 2 篇 lee jong-ryul
  • 1 篇 zhou xi
  • 1 篇 alexander hauptm...
  • 1 篇 lie zhang
  • 1 篇 taylor christine
  • 1 篇 petrini fabrizio
  • 1 篇 shoou-i yu
  • 1 篇 chetan moradiya
  • 1 篇 medrano f. anton...
  • 1 篇 pascoal marta m....
  • 1 篇 zhaoi peng
  • 1 篇 dulal kar

语言

  • 81 篇 英文
  • 5 篇 其他
  • 3 篇 中文
检索条件"主题词=Shortest path algorithms"
89 条 记 录,以下是1-10 订阅
排序:
shortest path algorithms for functional environments
收藏 引用
DISCRETE OPTIMIZATION 2015年 18卷 217-251页
作者: Boguchwal, Louis
This research generalises classic shortest path algorithms to network environments in which arc-costs are governed by functions, rather than fixed weights. We show that the asymptotic efficiency of our algorithms is i... 详细信息
来源: 评论
Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2012年 第3期218卷 775-788页
作者: Stepanov, Alexander Smith, James MacGregor Univ Massachusetts Dept Mech & Ind Engn Amherst MA 01003 USA
In this paper, a methodology for modeling surface wildfire propagation through a complex landscape is presented. The methodology utilizes a Delaunay triangulation to represent surface fire spread within the landscape.... 详细信息
来源: 评论
Unified all-pairs shortest path algorithms in the chordal hierarchy
收藏 引用
DISCRETE APPLIED MATHEMATICS 1997年 第1期77卷 59-71页
作者: Han, K Sekharan, CN Sridhar, R LOYOLA UNIV DEPT MATH & COMP SCI CHICAGO IL 60626 USA UNIV OKLAHOMA SCH COMP SCI NORMAN OK 73019 USA
The objective of this paper is to advance the view that solving the all-pairs shortest path (APSP) problem for a chordal graph G is a two-step process: the first step is determining vertex pairs at distance two (i.e.,... 详细信息
来源: 评论
NEW POLYNOMIAL shortest-path algorithms AND THEIR COMPUTATIONAL ATTRIBUTES
收藏 引用
MANAGEMENT SCIENCE 1985年 第9期31卷 1106-1128页
作者: GLOVER, F KLINGMAN, DD PHILLIPS, NV SCHNEIDER, RF UNIV TEXAS GRAD SCH BUSINESSAUSTINTX 78712
This paper presents six new variants of the polynomially bounded Partitioning shortest path (PSP) algorithm for finding the shortest path from one node to all other nodes in a network. Three of these variants, one for... 详细信息
来源: 评论
Comparative Analysis of Parallelised shortest path algorithms using Open MP  3
Comparative Analysis of Parallelised Shortest Path Algorithm...
收藏 引用
3rd IEEE International Conference on Sensing, Signal Processing and Security (ICSSS)
作者: Uditi Arun, M. VIT Univ Elect & Commun Engn Vellore Tamil Nadu India VIT Univ Embedded Syst Vellore Tamil Nadu India
this paper presents parallel implementations and includes performance analysis of three prominent graph algorithms (i.e., Bellman Ford, Floyd-Warshall and Dijkstra) used for finding the all-pairs of shortest paths. Th... 详细信息
来源: 评论
Critical Review of Time-Dependent shortest path algorithms: A Multimodal Trip Planner Perspective
收藏 引用
TRANSPORT REVIEWS 2014年 第4期34卷 522-539页
作者: Casey, Bradley Bhaskar, Ashish Guo, Hao Chung, Edward Queensland Univ Technol Fac Built Environm & Engn Smart Transport Res Ctr Brisbane Australia Queensland Univ Technol Smart Transport Res Ctr Fac Built Environm & Engn Brisbane Qld 4001 Australia
A multimodal trip planner that produces optimal journeys involving both public transport and private vehicle legs has to solve a number of shortest path problems, both on the road network and the public transport netw... 详细信息
来源: 评论
Scalable Single Source shortest path algorithms for Massively Parallel Systems
Scalable Single Source Shortest Path Algorithms for Massivel...
收藏 引用
IEEE 28th International Parallel & Distributed Processing Symposium (IPDPS)
作者: Chakaravarthy, Venkatesan T. Checconi, Fabio Petrini, Fabrizio Sabharwal, Yogish IBM Res India New Delhi India IBM Corp TJ Watson Res Ctr Armonk NY 10504 USA
In the single-source shortest path (SSSP) problem, we have to find the shortest paths from a source vertex v to all other vertices in a graph. In this paper, we introduce a novel parallel algorithm, derived from the B... 详细信息
来源: 评论
shortest path algorithms for Sensor Node Localization for Internet of Things
Shortest Path Algorithms for Sensor Node Localization for In...
收藏 引用
Emerging Trends in Communication, Control and Computing (ICONC3), International Conference on
作者: Ajay Kumar V. K. Jain P. P. Bhattacharya Computer Science and Engineering School of Engineering and Technology Mody University of Science and Technology Lakshmangarh India
Internet of Things have gained the interest of researchers and other academic communities due to their applications in various fields. Determining the location of a sensor node within the specified area consisting of ... 详细信息
来源: 评论
I/O-Efficient shortest path algorithms for Undirected Graphs with Random or Bounded Edge Lengths
收藏 引用
ACM TRANSACTIONS ON algorithms 2012年 第3期8卷 22-22页
作者: Meyer, Ulrich Zeh, Norbert Dalhousie Univ Fac Comp Sci Halifax NS B3H 1W5 Canada Goethe Univ Frankfurt Inst Informat D-60325 Frankfurt Germany
We present I/O-efficient single-source shortest path algorithms for undirected graphs. Our main result is an algorithm with I/O complexity O(root nm log L)/ B + MST(n, m)) on graphs with n vertices, m edges, and arbit... 详细信息
来源: 评论
Scalable Single Source shortest path algorithms for Massively Parallel Systems
Scalable Single Source Shortest Path Algorithms for Massivel...
收藏 引用
IEEE International Parallel and Distributed Processing Symposium
作者: Venkatesan T. Chakaravarthy Fabio Checconi Fabrizio Petrini Yogish Sabharwal IBM Research - India IBM T J Watson Research Center
In the single-source shortest path (SSSP) problem, we have to find the shortest paths from a source vertex v to all other vertices in a graph. In this paper, we introduce a novel parallel algorithm, derived from the B... 详细信息
来源: 评论