Research Article
Shortest Paths between two Points in Space for Self Managed Digital Systems
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 100 - Issue 13 |
| Published: August 2014 |
| Authors: Manoj Kumar |
10.5120/17582-8284
|
Manoj Kumar . Shortest Paths between two Points in Space for Self Managed Digital Systems. International Journal of Computer Applications. 100, 13 (August 2014), 1-3. DOI=10.5120/17582-8284
@article{ 10.5120/17582-8284,
author = { Manoj Kumar },
title = { Shortest Paths between two Points in Space for Self Managed Digital Systems },
journal = { International Journal of Computer Applications },
year = { 2014 },
volume = { 100 },
number = { 13 },
pages = { 1-3 },
doi = { 10.5120/17582-8284 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2014
%A Manoj Kumar
%T Shortest Paths between two Points in Space for Self Managed Digital Systems%T
%J International Journal of Computer Applications
%V 100
%N 13
%P 1-3
%R 10.5120/17582-8284
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In this paper, It has been proved that there can be more than one shortest path between two different points in space for self managed digital systems with finite memory space. Also, a formula has been given, that can be used to find total number of different paths between given two points.
References
- Donald Hearn and M. Pauline Baker. Computer Graphics C version. Dorling Kindersley (India) Pvt. Ltd. , Licensees of Pearson Education in South Asia, 2008.
- Edgar A. Kraut. Fundamentals of Mathematical Physics. Dover Publications, 2007.
- V. Rajaraman and T. Radhakrishnan. An Introduction to Digital Computer Design. Prentice-Hall of India Private Limited New Delhi, fourth edition, June 1998.
- James A. Storer and John H. Reif. Shortest paths in the plane with polygon obstacles. Journal of the Association for Computing Machinery, 41, No. 5:982–1012, september 1994.
Index Terms
Keywords