About J-GLOBAL

日本語

Font size
  • A
  • A

Articleの詳細情報

ArticleJ-GLOBAL ID:200902015693023474整理番号:91A0281212

区間最大値を求める単純な並列アルゴリズム

Simple parallel algorithms to compute interval maxima.

著者:中野浩嗣(大阪大 基礎工)、増沢利光(大阪大 情報処理教育セ)、都倉信樹(大阪大 基礎工)
資料名:電子情報通信学会論文誌 D-1 巻:74 号:2 ページ:146-154
発行年:1991年02月
  • J-GLOBAL home
  • Bookmark J-GLOBAL

J-GLOBAL: Linking, Expanding and Sparking

About J-GLOBAL

Linking

J-GLOBAL links information that represents the key to research and development. For example, linking articles and patents with people (authors and inventors) enables the extraction of a sequence of information.
It’s useful for making new discoveries and uncovering new information.

Expanding

The system enables searches of similar kinds of content through linkage with external sites.
It helps you to obtain knowledge from dissimilar fields and discover concepts that cross the boundaries of specialisms.

Sparking

Through repeated linkage and expansioniteration, J-GLOBAL provides unexpected hints for problem-solving and the illumination of new ideas.