咨询与建议

限定检索结果

文献类型

  • 4 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 4 篇 工学
    • 4 篇 计算机科学与技术...
  • 1 篇 理学
    • 1 篇 数学

主题

  • 4 篇 shortest-paths a...
  • 2 篇 rational power s...
  • 2 篇 finite-state tra...
  • 2 篇 finite automata
  • 1 篇 semiring
  • 1 篇 graph algorithms
  • 1 篇 semirings
  • 1 篇 ∊-removal
  • 1 篇 experimental ana...
  • 1 篇 transportation p...
  • 1 篇 network design
  • 1 篇 design and analy...

机构

  • 1 篇 at&t labs - rese...
  • 1 篇 rrtcs department...
  • 1 篇 max planck inst ...
  • 1 篇 los alamos natio...
  • 1 篇 at&t labs res fl...

作者

  • 1 篇 schäfer g
  • 1 篇 mehlhorn k
  • 1 篇 sivadasan n
  • 1 篇 jacob riko
  • 1 篇 nagel kai
  • 1 篇 mehryar mohri
  • 1 篇 marathe madhav
  • 1 篇 mohri m
  • 1 篇 priebe v

语言

  • 4 篇 英文
检索条件"主题词=Shortest-Paths Algorithms"
4 条 记 录,以下是1-10 订阅
排序:
All-pairs shortest-paths computation in the presence of negative cycles
收藏 引用
INFORMATION PROCESSING LETTERS 2002年 第6期81卷 341-343页
作者: Mehlhorn, K Priebe, V Schäfer, G Sivadasan, N Max Planck Inst Informat D-66123 Saarbrucken Germany
We present an algorithm that solves the all-pairs shortest-paths problem on a directed graph with n vertices and m arcs in time O(nm + n(2) logn), where the arcs are assigned real, possibly negative costs. Our algorit... 详细信息
来源: 评论
Minimization algorithms for sequential transducers
收藏 引用
THEORETICAL COMPUTER SCIENCE 2000年 第1-2期234卷 177-201页
作者: Mohri, M AT&T Labs Res Florham Park NJ 07932 USA
We present general algorithms for minimizing sequential finite-state transducers that output strings or numbers. The algorithms are shown to be efficient since in the case of acyclic transducers and for output strings... 详细信息
来源: 评论
GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION algorithms FOR WEIGHTED TRANSDUCERS
收藏 引用
International Journal of Foundations of Computer Science 2002年 第1期13卷 129-143页
作者: MEHRYAR MOHRI AT&T Labs - Research 180 Park Avenue Room E135 Florham Park NJ 07932 USA
We present a new generic ∊-removal algorithm for weighted automata and transducers defined over a semiring. The algorithm can be used with any semiring covered by our framework and works with any queue discipline adop... 详细信息
来源: 评论
A Computational Study of Routing algorithms for Realistic Transportation Networks
收藏 引用
ACM Journal of Experimental Algorithmics 1999年 4卷 6-6页
作者: Jacob, Riko Marathe, Madhav Nagel, Kai RRTCS Department of Computer Science University of Aarhus DK-8000 Århus C Ny Munkegade Bldg. 540 Denmark Los Alamos National Laboratory MS M997 Los Alamos NM 87545 P.O. Box 1663 United States
We carry out an experimental analysis of a number of shortest-path (routing) algorithms investigated in the context of the TRANSIMS (TRansportation ANalysis and SIMulation System) project. The main focus of the paper ... 详细信息
来源: 评论