Art
J-GLOBAL ID:200902090710733369   Reference number:84A0474093

A new dynamic programming algorithm and its application to optimal reentry problems.

新しい動的計画法アルゴリズムとその最適な再突入問題への応用
Author (2):
Material:
Page: 1031-1036  Publication year: 1982 
JST Material Number: K19840294  Document type: Proceedings
Article type: 原著論文  Country of issue: Japan (JPN)  Language: ENGLISH (EN)
Thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=84A0474093&from=J-GLOBAL&jstjournalNo=K19840294") }}
JST classification (1):
JST classification
Category name(code) classified by JST.
Motion and orbit of space crafts 
Terms in the title (4):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page