 | 2007 |
|---|
| 9 |       | Kengo Katayama,
Masashi Sadamatsu,
Hiroyuki Narihisa:
Iterated k-Opt Local Search for the Maximum Clique Problem.
EvoCOP 2007: 84-95 |
| 8 | | 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 |
| 2005 |
|---|
| 7 | | Hiroyuki Narihisa,
Takahiro Taniguchi,
Michiaki Thuda,
Kengo Katayama:
Efficiency of Parallel Exponential Evolutionary Programming.
ICPP Workshops 2005: 588-595 |
| 6 | | Kengo Katayama,
Takahiro Koshiishi,
Hiroyuki Narihisa:
Reinforcement learning agents with primary knowledge designed by analytic hierarchy process.
SAC 2005: 14-21 |
| 5 | | Kengo Katayama,
Akihiro Hamamoto,
Hiroyuki Narihisa:
An effective local search for the maximum clique problem.
Inf. Process. Lett. 95(5): 503-511 (2005) |
| 2004 |
|---|
| 4 | | Kengo Katayama,
Akihiro Hamamoto,
Hiroyuki Narihisa:
Solving the maximum clique problem by k-opt local search.
SAC 2004: 1021-1025 |
| 2000 |
|---|
| 3 |  | Kengo Katayama,
Masafumi Tani,
Hiroyuki Narihisa:
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm.
GECCO 2000: 643-650 |
| 1999 |
|---|
| 2 | | Kengo Katayama,
Hiroyuki Narihisa:
A New Iterated Local Search Algorithm Using Genetic Crossover for the Traveling Salesman Problem.
SAC 1999: 302-306 |
| 1 | | Kengo Katayama,
Hisayuki Hirabayashi,
Hiroyuki Narihisa:
Performance analysis for crossover operators of genetic algorithm.
Systems and Computers in Japan 30(2): 20-30 (1999) |
