Taishin Nakamura
Orcid: 0000-0002-0118-2964
According to our database1,
Taishin Nakamura
authored at least 9 papers
between 2017 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Birnbaum importance-based simulated annealing algorithm for solving the component assignment problem of linear connected-(r, s)-out-of-(m, n):F lattice systems.
Int. J. Syst. Assur. Eng. Manag., April, 2024
2023
Proposal of an Algorithm for Solving the Component Assignment Problem of an Adjacent Triangle-(m, n):F Triangular Lattice System.
Proceedings of the Computer Information Systems and Industrial Management, 2023
2022
Branch-and-bound-based algorithm for solving the multi-type component assignment problem in a consecutive- k $k$ -out-of- n $n$ : F system.
Qual. Reliab. Eng. Int., 2022
Generalization of Limit Theorems for Connected-(<i>r</i>, <i>s</i>)-out-of- (<i>m</i>, <i>n</i>): F Lattice Systems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022
2021
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021
2020
Algorithm for Solving Optimal Arrangement Problem in Connected-$(r, s)$-out-of-$(m, n)$: F Lattice System.
IEEE Trans. Reliab., 2020
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020
2018
Fast Algorithm for Optimal Arrangement in Connected-(<i>m</i>-1, <i>n</i>-1)-out-of-(<i>m</i>, <i>n</i>): F Lattice System.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
2017
Reliability of a Circular Connected-(1, 2)-or-(2, 1)-out-of-(<i>m</i>, <i>n</i>): F Lattice System with Identical Components.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017