Cart (Loading....) | Create Account
Close category search window

Design of algorithms for spatial-time reduction complexity of dynamic programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Moreno, L. ; Department of Applied Physics, Facultad de Fisica, Universidad de La Laguna, La Laguna, Tenerife, Spain ; Acosta, L. ; Sanchez, J.L.

The objective of the paper is the search for algorithms to reduce the spatial-time complexity of dynamic programming. These algorithms have been verified in second-order continuous systems, with indexes of performance where the time explicitly appears. The use of such algorithms is vital when dealing with third-order systems and second-order stochastic systems.

Published in:

Control Theory and Applications, IEE Proceedings D  (Volume:139 ,  Issue: 2 )

Date of Publication:

March 1992

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.