default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHisashi Yamamoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Taishin Nakamura
, Isshin Homma, Hisashi Yamamoto:
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. 15(4): 1407-1414 (2024)- 2022
- [j22]Koki Yamada, Taishin Nakamura, Hisashi Yamamoto:
Generalization of Limit Theorems for Connected-(r, s)-out-of- (m, n): F Lattice Systems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 562-570 (2022) - [j21]Lei Zhou, Hisashi Yamamoto:
Number of Failed Components in Consecutive-k-out-of-n: G Systems and Their Applications in Optimization Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(6): 943-951 (2022) - [j20]Taishin Nakamura, Hisashi Yamamoto:
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. 38(6): 3033-3050 (2022) - 2021
- [j19]Yoshihiro Murashima, Taishin Nakamura, Hisashi Yamamoto, Xiao Xiao:
Topological Optimization Problem for a Network System with Separate Subsystems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(5): 797-804 (2021) - 2020
- [j18]Lei Zhou, Hisashi Yamamoto, Taishin Nakamura, Xiao Xiao:
Optimization Problems for Consecutive-k-out-of-n: G Systems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(5): 741-748 (2020) - [j17]Taishin Nakamura, Hisashi Yamamoto:
Algorithm for Solving Optimal Arrangement Problem in Connected-$(r, s)$-out-of-$(m, n)$: F Lattice System. IEEE Trans. Reliab. 69(2): 497-509 (2020)
2010 – 2019
- 2018
- [j16]Taishin Nakamura, Hisashi Yamamoto, Tomoaki Akiba:
Fast Algorithm for Optimal Arrangement in Connected-(m-1, n-1)-out-of-(m, n): F Lattice System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2446-2453 (2018) - 2017
- [j15]Taishin Nakamura, Hisashi Yamamoto, Takashi Shinzato, Xiao Xiao, Tomoaki Akiba:
Reliability of a Circular Connected-(1, 2)-or-(2, 1)-out-of-(m, n): F Lattice System with Identical Components. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(4): 1029-1036 (2017) - [i1]Daichi Tada, Hisashi Yamamoto, Takashi Shinzato:
Random matrix approach for primal-dual portfolio optimization problems. CoRR abs/1709.04620 (2017) - 2016
- [j14]Tadashi Dohi, Hisashi Yamamoto:
Special Section on Computational Reliability in Engineering and Science. J. Comput. Sci. 17: 115-116 (2016) - 2015
- [j13]Toru Omura, Tomoaki Akiba, Xiao Xiao, Hisashi Yamamoto:
Algorithm for Obtaining Optimal Arrangement of a Connected-(r, s)-out-of-(m, n): F System - The Case of m=r and s=2 -. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(10): 2018-2024 (2015) - 2013
- [c11]Shunsuke Shibata, Yukiko Orito, Yoshiko Hanada, Hisashi Yamamoto:
EDA with Switching Distributions for Long-Short Portfolio Replication Problems. SMC 2013: 427-432 - [c10]Yukiko Orito, Yoshiko Hanada, Shunsuke Shibata, Hisashi Yamamoto:
A New Population Initialization Approach Based on Bordered Hessian for Portfolio Optimization Problems. SMC 2013: 1341-1346 - 2012
- [c9]Yukiko Orito, Hisashi Yamamoto, Yasuhiro Tsujimura:
Equality constrained long-short portfolio replication by using probabilistic model-building GA. IEEE Congress on Evolutionary Computation 2012: 1-8 - 2010
- [j12]Hisashi Yamamoto, Jing Sun, Masayuki Matsui:
A study on limited-cycle scheduling problem with multiple periods. Comput. Ind. Eng. 59(4): 675-681 (2010) - [c8]Yukiko Orito, Shota Sugizaki, Hisashi Yamamoto, Yasuhiro Tsujimura, Yasushi Kambayashi:
Index fund rebalancing using probabilistic model-building genetic algorithm with narrower width histograms. IEEE Congress on Evolutionary Computation 2010: 1-6
2000 – 2009
- 2009
- [j11]Tetsuo Yamada, Naoyuki Mizuhara, Hisashi Yamamoto, Masayuki Matsui:
A performance evaluation of disassembly systems with reverse blocking. Comput. Ind. Eng. 56(3): 1113-1125 (2009) - [j10]Koji Shingyochi, Hisashi Yamamoto:
Efficient Genetic Algorithm for Optimal Arrangement in a Linear Consecutive-k-out-of-n: F System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(7): 1578-1584 (2009) - [j9]Hisashi Yamamoto, Tomoaki Akiba, Hideki Nagatsuka:
Calculating Method for the System State Distributions of Generalized Multi-State k-out-of-n: F Systems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(7): 1593-1599 (2009) - [c7]Yasushi Kambayashi, Yasuhiro Tsujimura, Hidemi Yamachi, Munehiro Takimoto, Hisashi Yamamoto:
Design of a Multi-Robot System Using Mobile Agents with Ant Colony Clustering. HICSS 2009: 1-10 - 2008
- [j8]Hisashi Yamamoto, Tomoaki Akiba, Hideki Nagatsuka, Yurie Moriyama:
Recursive algorithm for the reliability of a connected-(1,2)-or-(2,1)-out-of-(m,n):F lattice system. Eur. J. Oper. Res. 188(3): 854-864 (2008) - [j7]Ji Hwan Cha, Hisashi Yamamoto, Won Young Yun:
Optimal Burn-in for Minimizing Total Warranty Cost. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(2): 633-641 (2008) - 2007
- [j6]Won Young Yun, Gui-Rae Kim, Hisashi Yamamoto:
Economic design of a circular consecutive-k-out-of-n: F system with (k-1)-step Markov dependence. Reliab. Eng. Syst. Saf. 92(4): 464-478 (2007) - [c6]Yukiko Orito, Hisashi Yamamoto:
Index fund optimization using a genetic algorithm and a heuristic local search algorithm on scatter diagrams. IEEE Congress on Evolutionary Computation 2007: 2562-2568 - [c5]Hidemi Yamachi, Hisashi Yamamoto, Yasuhiro Tsujimura, Yasushi Kambayashi:
A solution method employing a multi-objective genetic algorithm to search for pareto solutions of series-parallel system component allocation problem. IEEE Congress on Evolutionary Computation 2007: 3058-3064 - 2006
- [j5]Ji Hwan Cha, Hisashi Yamamoto, Won Young Yun:
Optimal Workload for a Multi-Tasking k-out-of-n: G Load Sharing System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 288-296 (2006) - [j4]Hidemi Yamachi, Yasuhiro Tsujimura, Yasushi Kambayashi, Hisashi Yamamoto:
Multi-objective genetic algorithm for solving N-version program design problem. Reliab. Eng. Syst. Saf. 91(9): 1083-1094 (2006) - [j3]Hisashi Yamamoto, Ming Jian Zuo, Tomoaki Akiba, Zhigang Tian:
Recursive formulas for the reliability of multi-state consecutive-k-out-of-n: G systems. IEEE Trans. Reliab. 55(1): 98-104 (2006) - [c4]Yukio Maruyama, Hisashi Yamamoto:
A Study for Forecasting Water Supply Demand in the Area-K Waterworks Service Area. ACIS-ICIS 2006: 136-141 - [c3]Hidemi Yamachi, Hisashi Yamamoto, Yasuhiro Tsujimura, Yasushi Kambayashi:
Searching Pareto Solutions of Bi-objective NVP System Design Problem with Breadth First Search Method. ACIS-ICIS 2006: 252-258 - [c2]Yukiko Orito, Jun Takano, Manabu Takeda, Hisashi Yamamoto:
Index Fund Optimization Using GA Based on Coefficients of Determination. ACIS-ICIS 2006: 412-417 - 2005
- [j2]Hisashi Yamamoto, Tomoaki Akiba:
A recursive algorithm for the reliability of a circular connected-(r, s)-out-of-(m, n): F lattice system. Comput. Ind. Eng. 49(1): 21-34 (2005) - [c1]Hidemi Yamachi, Yasuhiro Tsujimura, Hisashi Yamamoto:
Pareto Distance-based MOGA for Solving Bi-objective N -Version Program Design Problem. WSTST 2005: 412-422 - 2003
- [j1]Yukiko Orito, Hisashi Yamamoto, Genji Yamazaki:
Index fund selections with genetic algorithms and heuristic classifications. Comput. Ind. Eng. 45(1): 97-109 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 01:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
