✦ LIBER ✦

An efficient PASTd-algorithm implementation for multiple direction of arrival tracking

✍ Scribed by Sanchez-Araujo, J.; Marcos, S.

Book ID: 118690231
Publisher: IEEE
Year: 1999
Tongue: English
Weight: 121 KB
Volume: 47
Category: Article
ISSN: 1053-587X
DOI: 10.1109/78.774778

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tracking the direction-of-arrival of mul

Tracking the direction-of-arrival of multiple moving targets by passive arrays: algorithm

✍ Yifeng Zhou; Yip, P.C.; Leung, H. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 272 KB

An efficient algorithm for tracking the

An efficient algorithm for tracking the angles of arrival of moving targets

✍ Sastry, C.R.; Kamen, E.W.; Simaan, M. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 635 KB

AN ALGORITHM FOR DIGITAL IMPLEMENTATION

AN ALGORITHM FOR DIGITAL IMPLEMENTATION OF TRAJECTORY TRACKING CONTROLLERS

✍ J. L. Mancilla Aguilar; R. A. García; M. I. Troparevsky 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

A multiple candidate time of arrival alg

A multiple candidate time of arrival algorithm for tracking nodes in multipath environments

✍ T. Sathyan; M. Hedley; D. Humphrey 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 598 KB

An implementation of an efficient algori

An implementation of an efficient algorithm for bisimulation equivalence

✍ Jean-Claude Fernandez 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 943 KB

An efficient implementation of an algori

An efficient implementation of an algorithm for findingK shortest simple paths

✍ Hadjiconstantinou, E.; Christofides, N. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 263 KB 👁 1 views

In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho