Art
J-GLOBAL ID:201802217485636208   Reference number:18A0845765

An Asynchronous P System Using Branch and Bound for the Satisfiability Problem

充足可能性問題のための分岐と限界を用いた非同期Pシステム【JST・京大機械翻訳】
Author (2):
Material:
Volume: 2017  Issue: CANDAR  Page: 408-413  Publication year: 2017 
JST Material Number: W2441A  Document type: Proceedings
Article type: 原著論文  Country of issue: United States (USA)  Language: ENGLISH (EN)
Abstract/Point:
Abstract/Point
Japanese summary of the article(about several hundred characters).
All summary 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.
Membrane computing, which is a...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=18A0845765&from=J-GLOBAL&jstjournalNo=W2441A") }}
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.
, 【Automatic Indexing@JST】
JST classification (1):
JST classification
Category name(code) classified by JST.
Theory of computation 
Terms in the title (4):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page