Travelled to:1 × Cyprus
1 × Taiwan
1 × USA
Collaborated with:H.Narihisa T.Koshiishi A.Hamamoto A.Kohmura K.Kohmoto H.Minamihara
Talks about:problem (3) algorithm (2) maximum (2) search (2) local (2) cliqu (2) hierarchi (1) salesman (1) reinforc (1) knowledg (1)
Person: Kengo Katayama
DBLP: Katayama:Kengo
Contributed to:
2011200520041999Wrote 4 papers:
- SAC-2011-KatayamaKKM #algorithm #clique #problem
- Memetic algorithm with strategic controller for the maximum clique problem (KK, AK, KK, HM), pp. 1062–1069.
- SAC-2005-KatayamaKN #learning #process
- Reinforcement learning agents with primary knowledge designed by analytic hierarchy process (KK, TK, HN), pp. 14–21.
- SAC-2004-KatayamaHN #clique #problem
- Solving the maximum clique problem by k-opt local search (KK, AH, HN), pp. 1021–1025.
- SAC-1999-KatayamaN #algorithm #problem #search-based #using
- A New Iterated Local Search Algorithm Using Genetic Crossover for the Traveling Salesman Problem (KK, HN), pp. 302–306.