Art
J-GLOBAL ID:200902284168664699   Reference number:05A0745567

Optimum Ordering Algorithm Suitable for Cluster System Based on Parallel Branch and Bound Method and Dynamic Division of Search Tree

並列分枝限定法と動的探索木分割によるクラスタシステム向き最適順序付けアルゴリズム
Author (1):
Material:
Volume: 46  Issue: SIG12(ACS11)  Page: 330-337  Publication year: Aug. 15, 2005
JST Material Number: Z0778A  ISSN: 0387-5806  Document type: Article
Article type: 原著論文  Country of issue: Japan (JPN)  Language: JAPANESE (JA)
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.
,...
Semi 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("テキストリンク | 文献 | EN | PC", "JDreamIII(抄録)", "http://jdream3.com/lp/jglobal/index.html?docNo=05A0745567&from=J-GLOBAL&jstjournalNo=Z0778A") }}
JST classification (3):
JST classification
Category name(code) classified by JST.
Digital computer systems in general  ,  Motion and control of robots  ,  Computer system development 
Terms in the title (5):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page