Simulation Algorithm of Shortest Match Path Based on Time Series

DOI

10.2991/cisia-15.2015.251How to use a DOI?

Keywords

simulation technology; shortest match path; format

Abstract

Two new corresponding algorithmsare proposed based on the analysis of several classicalalgorithms to solve the problem of the shortest match path based on time series.Experiments show formatting reverse branch algorithm with high execution efficiency can obtain all matching path. Dynamic path matching algorithm enhances the real-time property on the basis of getting all matching path.The new algorithms have incomparable advantage on both the accuracy and efficiency.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - M.J Wu
PY  - 2015/06
DA  - 2015/06
TI  - Simulation Algorithm of Shortest Match Path Based on Time Series
BT  - Proceedings of the International Conference on Computer Information Systems and Industrial Applications
PB  - Atlantis Press
SP  - 928
EP  - 930
SN  - 2352-538X
UR  - https://doi.org/10.2991/cisia-15.2015.251
DO  - 10.2991/cisia-15.2015.251
ID  - Wu2015/06
ER  -