An effective local search for the maximum clique problem K Katayama, A Hamamoto, H Narihisa Information Processing Letters 95 (5), 503-511, 2005 | 143 | 2005 |
Memetic algorithms for the unconstrained binary quadratic programming problem P Merz, K Katayama BioSystems 78 (1-3), 99-118, 2004 | 135 | 2004 |
The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem K Katayama, H Sakamoto, H Narihisa Mathematical and computer modelling 31 (10-12), 197-203, 2000 | 132 | 2000 |
Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem K Katayama, H Narihisa European Journal of Operational Research 134 (1), 103-119, 2001 | 128 | 2001 |
Iterated local search approach using genetic transformation to the traveling salesman problem K Katayama, H Narihisa GECCO 1999 : Proceedings of the 1st Annual Conference on Genetic and …, 1999 | 75 | 1999 |
Solving large binary quadratic programming problems by effective genetic local search algorithm K Katayama, M Tani, H Narihisa GECCO 2000 : Proceedings of the 2nd Annual Conference on Genetic and …, 2000 | 69 | 2000 |
An evolutionary approach for the maximum diversity problem K Katayama, H Narihisa Recent advances in memetic algorithms, 31-47, 2005 | 29 | 2005 |
Solving the maximum clique problem by k-opt local search K Katayama, A Hamamoto, H Narihisa SAC 2004 : Proceedings of the 2004 ACM symposium on Applied computing, 1021-1025, 2004 | 28 | 2004 |
Design of a deep Q-network based simulation system for actuation decision in ambient intelligence T Oda, C Ueda, R Ozaki, K Katayama Web, Artificial Intelligence and Network Applications: Proceedings of the …, 2019 | 26 | 2019 |
Design and implementation of a DQN based AAV N Saito, T Oda, A Hirata, Y Hirota, M Hirota, K Katayama Advances on Broad-Band Wireless Computing, Communication and Applications …, 2021 | 25 | 2021 |
A coverage construction method based hill climbing approach for mesh router placement optimization A Hirata, T Oda, N Saito, M Hirota, K Katayama Advances on broad-band wireless computing, communication and applications …, 2021 | 25 | 2021 |
Performance of a genetic algorithm for the graph partitioning problem K Kohmoto, K Katayama, H Narihisa Mathematical and computer modelling 38 (11-13), 1325-1332, 2003 | 25 | 2003 |
Performance analysis of a new genetic crossover for the traveling salesman problem K Katayama, H Hirabayashi, H Narihisa IEICE transactions on fundamentals of electronics, communications and …, 1998 | 25 | 1998 |
A Tabu list strategy based DQN for AAV mobility in indoor single-path environment: implementation and performance evaluation N Saito, T Oda, A Hirata, Y Nagai, M Hirota, K Katayama, L Barolli Internet of Things 14, 100394, 2021 | 24 | 2021 |
Analysis of crossovers and selections in a coarse-grained parallel genetic algorithm K Katayama, H Hirabayashi, H Narihisa Mathematical and Computer Modelling 38 (11-13), 1275-1282, 2003 | 24 | 2003 |
Approach of a solution construction method for mesh router placement optimization problem A Hirata, T Oda, N Saito, K Kanahara, M Hirota, K Katayama 2020 IEEE 9th Global Conference on Consumer Electronics (GCCE), 467-468, 2020 | 23 | 2020 |
Iterated k-opt local search for the maximum clique problem K Katayama, M Sadamatsu, H Narihisa EvoCOP 2007 : Proceedings of 7th European Conference on Evolutionary …, 2007 | 22 | 2007 |
On fundamental design of parthenogenetic algorithm for the binary quadratic programming problem K Katayama, H Narihisa IEEE CEC 2001 : Proceedings of the 2001 IEEE Congress on Evolutionary …, 2001 | 21 | 2001 |
An efficient hybrid genetic algorithm for the traveling salesman problem K Katayama, H Narihisa Electronics and Communications in Japan (Part III: Fundamental Electronic …, 2001 | 21 | 2001 |
Performance analysis for crossover operators of genetic algorithm K Katayama, H Hirabayashi, H Narihisa Systems and Computers in Japan 30 (2), 20-30, 1999 | 21 | 1999 |