Equations are not being displayed properly on some articles. We hope to have this fixed soon. Our apologies.

Bagadi, R. (2017). The Recursive Future And Past Equation Based On The Ananda-Damayanthi Normalized Similarity Measure Considered To Exhaustion . ISSN 1751-3030. PHILICA.COM Article number 1031.

ISSN 1751-3030  
Log in  
Register  
  1270 Articles and Observations available | Content last updated 13 December, 05:46  
Philica entries accessed 3 491 746 times  


NEWS: The SOAP Project, in collaboration with CERN, are conducting a survey on open-access publishing. Please take a moment to give them your views

Submit an Article or Observation

We aim to suit all browsers, but recommend Firefox particularly:

The Recursive Future And Past Equation Based On The Ananda-Damayanthi Normalized Similarity Measure Considered To Exhaustion . ISSN 1751-3030

Ramesh Chandra Bagadiunconfirmed user (Physics, Engineering Mechanics, Civil & Environmental Engineering, University of Wisconsin)

Published in matho.philica.com

Abstract
In this research investigation, the author has presented a Recursive Past Equation and a Recursive Future Equation based on the Ananda-Damayanthi Normalized Similarity Measure considered to Exhaustion [1].

Article body

 

Information about this Article
This Article has not yet been peer-reviewed
This Article was published on 20th May, 2017 at 09:35:17 and has been viewed 693 times.

Creative Commons License
This work is licensed under a Creative Commons Attribution 2.5 License.
The full citation for this Article is:
Bagadi, R. (2017). The Recursive Future And Past Equation Based On The Ananda-Damayanthi Normalized Similarity Measure Considered To Exhaustion . ISSN 1751-3030. PHILICA.COM Article number 1031.


<< Go back Review this ArticlePrinter-friendlyReport this Article



Website copyright © 2006-07 Philica; authors retain the rights to their work under this Creative Commons License and reviews are copyleft under the GNU free documentation license.
Using this site indicates acceptance of our Terms and Conditions.

This page was generated in 0.2715 seconds.