Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Ryuzo Hasegawa"'
Autor:
Masayoshi Nagano, Shoko Yuzawa, Kazuhisa Sugisaki, Naoto Nakajima, Taku Nakano, Tetsuya Takano, Satoshi Sonoda, Ryuzo Hasegawa
Publikováno v:
AIJ Journal of Technology and Design. 26:713-718
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c88cf3152f049e2f8cf0ceb5af17ca55
https://doi.org/10.3130/aijt.26.713
https://doi.org/10.3130/aijt.26.713
Publikováno v:
Journal of the City Planning Institute of Japan. 52:508-513
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bcee78ee867490882a48e182f4e49e02
https://doi.org/10.11361/journalcpij.52.508
https://doi.org/10.11361/journalcpij.52.508
Publikováno v:
IEICE Transactions on Information and Systems. :1812-1821
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a9c6048d882d04f023075468cb1e6ff
https://doi.org/10.1587/transinf.e97.d.1812
https://doi.org/10.1587/transinf.e97.d.1812
Publikováno v:
IEICE Transactions on Information and Systems. :1781-1789
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2431b99148ea256e534417e66c6cf8ba
https://doi.org/10.1587/transinf.e97.d.1781
https://doi.org/10.1587/transinf.e97.d.1781
Publikováno v:
Journal on Satisfiability, Boolean Modeling and Computation. 8:95-100
We present a partial Max-SAT solver QMaxSAT which uses CNF encoding of Boolean cardinality constraints. The old version 0.1 was obtained by adapting a CDCL based SAT solver MiniSat to manage cardinality constraints. It was placed rst in the industria
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9adfb7eabb0696eb4a1f715c86145a7e
https://doi.org/10.3233/sat190091
https://doi.org/10.3233/sat190091
Publikováno v:
The Journal of Supercomputing. 47:228-252
Current trend of research on multithreading processors is toward the chip multithreading (CMT), which exploits thread level parallelism (TLP) and improves performance of softwares built on traditional threading components, e.g., Pthread. There exist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb3a3dbd325737654bfe4b416aa7f92e
https://doi.org/10.1007/s11227-008-0246-5
https://doi.org/10.1007/s11227-008-0246-5
Autor:
Miyuki Koshimura, Masato Shibasaki, Katsumi Nitta, Yoshiaki Yasumura, Ryuzo Hasegawa, Yasuyuki Shirai, Hiroshi Komatsu, Hiroshi Fujita, Katsumi Inoue
Publikováno v:
Transactions of the Japanese Society for Artificial Intelligence. 17:32-43
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30b7c375d120e26db279a1170cad5c07
https://doi.org/10.1527/tjsai.17.32
https://doi.org/10.1527/tjsai.17.32
Publikováno v:
Transactions of the Japanese Society for Artificial Intelligence. 16:234-245
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11c55db65cf5d79c6836822556a2f55b
https://doi.org/10.1527/tjsai.16.234
https://doi.org/10.1527/tjsai.16.234
Publikováno v:
IEICE Transactions on Information and Systems. (8):2316-2318
This paper tries to solve open Job-Shop Scheduling Problems (JSSP) by translating them into Boolean Satisfiability Testing Problems (SAT). The encoding method is essentially the same as the one proposed by Crawford and Baker. The open problems are AB
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d00ff27a4ac85ca8295a3ab3a3cbcd65
http://hdl.handle.net/2324/26359
http://hdl.handle.net/2324/26359
Publikováno v:
Parallel Computing. 25:1601-1633
In the fifth generation computer systems (FGCS) project, a parallel logic programming language, KL1, was adopted as the project's kernel language. It was not only used to determine architectures of highly parallel machines called parallel inference m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab7decabe5615a871ba4cf3fef5f8f80
https://doi.org/10.1016/s0167-8191(99)00075-7
https://doi.org/10.1016/s0167-8191(99)00075-7