| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
What is dynamic programming? This paper is concerned with the class of all dynamic programmings - with or without optimization. Where is an origin in the class? What is it? The paper is a travel which... leads to the origin. We present a primitive form of dynamic programming. It is a non-deterministic dynamic programming, which generates stochastic dynamic programming, which in turn reduces to deterministic dynamic programming. Thus we propose the nondeterministic dynamic programming as a primitive dynamic programming.続きを見る
|
Mendeley出力
