Zobrazeno 1 - 10 of 78 pro vyhledávání: '"Sumio MASUDA"'
1
Akademický článek
Public Acceptance as a Driver for Repository Design
Autor: Ian G. McKinley, Sumio Masuda, Susie M. L. Hardie, Hiroyuki Umeki, Morimasa Naito, Hiroyasu Takase
Publikováno v: Journal of Energy, Vol 2018 (2018)
The Japanese geological disposal programme for radioactive waste is based on a volunteering approach to siting, which places particular emphasis on the need for public acceptance. This, as established in law, emphasises the development of a repositor
Externí odkaz: https://doaj.org/article/b4aa6aa1898d4a8bab0ea55e6471d655
Zobrazit plný text záznamu
3
Public Acceptance as a Driver for Repository Design
Autor: Sumio Masuda, Morimasa Naito, Hiroyuki Umeki, Hiroyasu Takase, S.M.L. Hardie, Ian G. McKinley
Publikováno v: Journal of Energy, Vol 2018 (2018)
The Japanese geological disposal programme for radioactive waste is based on a volunteering approach to siting, which places particular emphasis on the need for public acceptance. This, as established in law, emphasises the development of a repositor
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13282feb30c80bc363e85b90c6610a33
https://doi.org/10.1155/2018/7546158
Zobrazit plný text záznamu
5
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
Autor: Satoshi Shimizu, Sumio Masuda, Kazuaki Yamaguchi
Publikováno v: Discrete Optimization. 41:100646
In this paper, parallelization techniques are proposed for the branch-and-bound algorithm OTClique for the maximum weight clique problem. OTClique consists of the precomputation phase and the branch-and-bound phase. The proposed algorithm parallelize
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8dabdc1248c2caf1259d7124532fbefa
https://doi.org/10.1016/j.disopt.2021.100646
Zobrazit plný text záznamu
6
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound
Autor: Kazuaki Yamaguchi, Satoshi Shimizu, Toshiki Saitoh, Sumio Masuda
Publikováno v: Discrete Applied Mathematics. 223:120-134
A new branch-and-bound algorithm for the maximum weight clique problem is proposed. The proposed algorithm consists of two phases, a precomputation phase and a branch-and-bound phase. In the precomputation phase, the weights of maximum weight cliques
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f9b7f54be6e3a3c958777983fa2980c
https://hdl.handle.net/20.500.14094/90004069
Zobrazit plný text záznamu
7
A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem
Autor: Sumio Masuda, Kazuaki Yamaguchi, Satoshi Shimizu
Publikováno v: Computational Science/Intelligence & Applied Informatics ISBN: 9783319968056
CSII (selected papers)
The maximum edge-weight clique problem is to find a clique whose sum of edge-weight is maximum for a given edge-weighted undirected graph. The problem is NP-hard and was formulated as a mathematical programming problem in previous studies. In this pa
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0d17343f9ce5ad3602287e8bb556468b
https://doi.org/10.1007/978-3-319-96806-3_3
Zobrazit plný text záznamu
9
A Maximum Edge-Weight Clique Extraction Algorithm Based on Branch-and-Bound
Autor: Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda
The maximum edge-weight clique problem is to find a clique whose sum of edge-weight is the maximum for a given edge-weighted undirected graph. The problem is NP-hard and some branch-and-bound algorithms have been proposed. In this paper, we propose a
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ddb7bc46e8627c967f4bdbd56889a1f4
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje