Art
J-GLOBAL ID：200902099184603754
Reference number：89A0390773
Algorithms for finding maximum and selecting median on a processor array with separable global buses.
分割可能なグローバルバスをもつプロセッサアレー上での最大値選出と中央値選択問題
-
Publisher site
Copy service
{{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=89A0390773©=1") }}
-
Access JDreamⅢ for advanced search and analysis.
{{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=89A0390773&from=J-GLOBAL&jstjournalNo=S0621A") }}
Author (3)：
,
,
Material：
Volume：
72
Issue：
6
Page：
950-958
Publication year：
Jun. 1989
JST Material Number：
S0621A
ISSN：
0913-5707
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.
,...
JST classification (1)：
JST classification
Category name(code) classified by JST.
Special-purpose arithmetic and control units
Terms in the title (6)：
Terms in the title
Keywords automatically extracted from the title.
,
,
,
,
,
Return to Previous Page
