An optimal assignment problem for multiple objects per period. Case of a partially observable Markov chain.

NAKAI T

Art

J-GLOBAL ID：200902140311460380 Reference number：99A0764517

An optimal assignment problem for multiple objects per period. Case of a partially observable Markov chain.

時間毎の複数オブジェクトの最適割り当て問題部分的に観察可能なマルコフ連鎖の事例

Publisher site Copy service {{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=99A0764517&COPY=1") }}
Access JDreamⅢ for advanced search and analysis. {{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=99A0764517&from=J-GLOBAL&jstjournalNo=L1047A") }}

Author (1)：
Material：
Volume： 31 Issue： 1 Page： 23-34 Publication year： Mar. 1999
JST Material Number： L1047A ISSN： 0286-522X Document type： Article
Country of issue： Japan (JPN) Language： ENGLISH (EN)

, , ,

Return to Previous Page