default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroyuki Narihisa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2005
[j5]Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihisa:
An effective local search for the maximum clique problem. Inf. Process. Lett. 95(5): 503-511 (2005)- [j4]Hirotaka Inoue, Hiroyuki Narihisa:
Parallel performance of ensemble self-generating neural networks for chaotic time series prediction problems. Syst. Comput. Jpn. 36(10): 82-92 (2005) - 2001
- [j3]Kengo Katayama, Hiroyuki Narihisa:
Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem. Eur. J. Oper. Res. 134(1): 103-119 (2001) - 1999
- [j2]Kengo Katayama, Hisayuki Hirabayashi, Hiroyuki Narihisa:
Performance analysis for crossover operators of genetic algorithm. Syst. Comput. Jpn. 30(2): 20-30 (1999) - 1991
- [j1]Hiroshi Ohtera, Shigeru Yamada, Hiroyuki Narihisa:
Software reliability growth model for testing-domain. Syst. Comput. Jpn. 22(2): 19-24 (1991)
Conference and Workshop Papers
- 2008
- [c21]Hirotaka Inoue, Hiroyuki Narihisa:
Efficient Incremental Learning with Self-Organizing Neural Grove. DMIN 2008: 578-582 - 2007
- [c20]Kengo Katayama, Hiroshi Yamashita, Hiroyuki Narihisa:
Variable depth search and iterated local search for the node placement problem in multihop WDM lightwave networks. IEEE Congress on Evolutionary Computation 2007: 3508-3515 - [c19]Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihisa:
Iterated k-Opt Local Search for the Maximum Clique Problem. EvoCOP 2007: 84-95 - [c18]Hirotaka Inoue, Hiroyuki Narihisa:
Efficient Incremental Learning Using Self-Organizing Neural Grove. ICONIP (1) 2007: 762-770 - 2006
- [c17]Hiroyuki Narihisa, Takahiro Taniguchi, Mayumi Ohta, Kengo Katayama:
Exponential Evolutionary Programming Without Self-Adaptive Strategy Parameter. IEEE Congress on Evolutionary Computation 2006: 544-551 - [c16]Hiroyuki Narihisa, Keiko Kohmoto, Takahiro Taniguchi, Mayumi Ohta, Kengo Katayama:
Evolutionary Programming With Only Using Exponential Mutation. IEEE Congress on Evolutionary Computation 2006: 552-559 - 2005
- [c15]Hiroyuki Narihisa, Takahiro Taniguchi, Michiaki Thuda, Kengo Katayama:
Efficiency of Parallel Exponential Evolutionary Programming. ICPP Workshops 2005: 588-595 - [c14]Hirotaka Inoue, Hiroyuki Narihisa:
Self-organizing neural grove: effective multiple classifier system with pruned self-generating neural trees. ISCAS (3) 2005: 2502-2505 - [c13]Kengo Katayama, Takahiro Koshiishi, Hiroyuki Narihisa:
Reinforcement learning agents with primary knowledge designed by analytic hierarchy process. SAC 2005: 14-21 - 2004
- [c12]Hirotaka Inoue, Hiroyuki Narihisa:
Self-organizing Neural Grove: Efficient Multiple Classifier System Using Pruned Self-generating Neural Trees. PPSN 2004: 1113-1122 - [c11]Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihisa:
Solving the maximum clique problem by k-opt local search. SAC 2004: 1021-1025 - 2003
- [c10]Hirotaka Inoue, Hiroyuki Narihisa:
Effective Pruning Method for a Multiple Classifier System Based on Self-Generating Neural Networks. ICANN 2003: 11-18 - [c9]Hirotaka Inoue, Hiroyuki Narihisa:
Improving Performance of a Multiple Classifier System Using Self-generating Neural Networks. Multiple Classifier Systems 2003: 256-265 - 2002
- [c8]Hirotaka Inoue, Hiroyuki Narihisa:
Optimizing a Multiple Classifier System. PRICAI 2002: 285-294 - 2001
- [c7]Kengo Katayama, Hiroyuki Narihisa:
On fundamental design of parthenogenetic algorithm for the binary quadratic programming problem. CEC 2001: 356-363 - [c6]Hirotaka Inoue, Yoshinobu Fukunaga, Hiroyuki Narihisa:
Efficient Hybrid Neural Network for Chaotic Time Series Prediction. ICANN 2001: 712-718 - [c5]Hirotaka Inoue, Hiroyuki Narihisa:
Parallel and Distributed Mining with Ensemble Self-Generating Neural Networks. ICPADS 2001: 423-428 - 2000
- [c4]Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa:
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm. GECCO 2000: 643-650 - [c3]Hirotaka Inoue, Hiroyuki Narihisa:
Predicting Chaotic Time Series by Ensemble Self-Generating Neural Networks. IJCNN (2) 2000: 231-236 - [c2]Hirotaka Inoue, Hiroyuki Narihisa:
Improving Generalization Ability of Self-Generating Neural Networks Through Ensemble Averaging. PAKDD 2000: 177-180 - 1999
- [c1]Kengo Katayama, Hiroyuki Narihisa:
A New Iterated Local Search Algorithm Using Genetic Crossover for the Traveling Salesman Problem. SAC 1999: 302-306
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-04-24 23: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:
