default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKengo Katayama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]Kazuho Kanahara, Kengo Katayama, Etsuji Tomita:
Speeding-Up Construction Algorithms for the Graph Coloring Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1241-1251 (2022)- [c50]Aoto Hirata, Tetsuya Oda, Nobuki Saito, Yuki Nagai, Tomoya Yasunaga, Kengo Katayama, Leonard Barolli:
A Voronoi Edge and CCM-Based SA Approach for Mesh Router Placement Optimization in WMNs: A Comparison Study for Different Edges. AINA (3) 2022: 220-231 - [c49]Yuma Yamashita, Nobuki Saito, Chihiro Yukawa, Kyohei Toyoshima, Tetsuya Oda, Kengo Katayama, Leonard Barolli:
A Simulation System for Mobility Control of Swarm Drones to Provide Wireless Mesh Network Services. BWCCA 2022: 323-331 - [c48]Aoto Hirata, Tetsuya Oda, Yuki Nagai, Tomoya Yasunaga, Nobuki Saito, Kengo Katayama, Leonard Barolli:
A New Method for Optimization of Number of Mesh Routers and Improving Cost Efficiency in Wireless Mesh Networks. CISIS 2022: 37-48 - [c47]Kazuho Kanahara, Tetsuya Oda, Elis Kulla, Akira Uejima, Kengo Katayama:
An Efficient Local Search for the Maximum Clique Problem on Massive Graphs. EIDWT 2022: 201-211 - [c46]Aoto Hirata, Tetsuya Oda, Nobuki Saito, Tomoya Yasunaga, Kengo Katayama, Leonard Barolli:
A Delaunay Edge and CCM-Based SA Approach for Mesh Router Placement Optimization in WMN: A Case Study for Evacuation Area in Okayama City. EIDWT 2022: 346-356 - [c45]Chihiro Yukawa, Tetsuya Oda, Nobuki Saito, Aoto Hirata, Tomoya Yasunaga, Kyohei Toyoshima, Kengo Katayama:
Design of a Robot Vision System for Microconvex Recognition. EIDWT 2022: 366-374 - [c44]Kazuho Kanahara, Shun Ito, Kengo Katayama:
The Performance of a Local Search based on Vertex Coloring for the Maximum Clique Problem. ICCCM 2022: 79-83 - [c43]Shun Ito, Kazuho Kanahara, Tetsuya Oda, Kengo Katayama:
An Extended NEH based Method for Permutation Flowshop Scheduling Problem. ICCCM 2022: 252-256 - [c42]Tomoya Yasunaga, Tetsuya Oda, Kyohei Toyoshima, Yuki Nagai, Chihiro Yukawa, Kengo Katayama, Leonard Barolli:
An Indicate System for Danger Detection and Its Soldering Motion Analysis. IMIS 2022: 31-40 - 2021
- [j4]Nobuki Saito, Tetsuya Oda, Aoto Hirata, Yuki Nagai, Masaharu Hirota, Kengo Katayama, Leonard Barolli:
A Tabu list strategy based DQN for AAV mobility in indoor single-path environment: Implementation and performance evaluation. Internet Things 14: 100394 (2021) - [c41]Aoto Hirata, Tetsuya Oda, Nobuki Saito, Tomoya Yasunaga, Kengo Katayama, Leonard Barolli:
A Simulation System for Mesh Router Placement in WMNs Considering Coverage Construction Method and Simulated Annealing. BWCCA 2021: 78-87 - [c40]Aoto Hirata, Tetsuya Oda, Nobuki Saito, Yuki Nagai, Masaharu Hirota, Kengo Katayama, Leonard Barolli:
A Coverage Construction and Hill Climbing Approach for Mesh Router Placement Optimization: Simulation Results for Different Number of Mesh Routers and Instances Considering Normal Distribution of Mesh Clients. CISIS 2021: 161-171 - [c39]Elis Kulla, Kengo Katayama, Keita Matsuo
, Leonard Barolli:
Enhanced Focused Beam Routing in Underwater Wireless Sensor Networks. EIDWT 2021: 1-9 - [c38]Aoto Hirata, Tetsuya Oda, Nobuki Saito, Yuki Nagai, Masaharu Hirota, Kengo Katayama:
Simulation Results of CCM Based HC for Mesh Router Placement Optimization Considering Two Islands Model of Mesh Clients Distributions. EIDWT 2021: 180-188 - [c37]Nobuki Saito, Tetsuya Oda, Aoto Hirata, Yuki Nagai, Masaharu Hirota, Kengo Katayama:
Proposal and Evaluation of a Tabu List Based DQN for AAV Mobility. EIDWT 2021: 189-200 - [c36]Kyohei Toyoshima, Tetsuya Oda, Nobuki Saito, Aoto Hirata, Masaharu Hirota, Kengo Katayama:
Proposal of a Haptics and LSTM Based Soldering Motion Analysis System. GCCE 2021: 1-2 - [c35]Tomoaki Matsui, Tetsuya Oda, Nobuki Saito, Aoto Hirata, Masaharu Hirota, Kengo Katayama:
FPGA Implementation of a Fuzzy Inference Based Quadrotor Attitude Control System. GCCE 2021: 691-692 - [c34]Aoto Hirata, Tetsuya Oda, Nobuki Saito, Yuki Nagai, Kengo Katayama, Masaharu Hirota:
Proposal of a Semi-automatic Graph Generation System for Raster Map. GCCE 2021: 693-694 - [c33]Tomoya Yasunaga, Tetsuya Oda, Nobuki Saito, Aoto Hirata, Kyohei Toyoshima, Kengo Katayama:
Object Detection and Pose Estimation Approaches for Soldering Danger Detection. GCCE 2021: 697-698 - [c32]Chihiro Yukawa, Tetsuya Oda, Nobuki Saito, Aoto Hirata, Kyohei Toyoshima, Kengo Katayama:
Design of a Fuzzy Inference Based Robot Vision for CNN Training Image Acquisition. GCCE 2021: 806-807 - 2020
- [c31]Yuki Nagai, Nobuki Saito, Aoto Hirata, Tetsuya Oda, Masaharu Hirota, Kengo Katayama:
Approach of a Word2Vec Based Tourist Spot Collection Method Considering COVID-19. BWCCA 2020: 67-75 - [c30]Kazuho Kanahara, Kengo Katayama, Takafumi Miyake, Etsuji Tomita:
Speeding-Up of Construction Algorithms for the Graph Coloring Problem. BWCCA 2020: 211-222 - [c29]Nobuki Saito, Tetsuya Oda, Aoto Hirata, Yuto Hirota, Masaharu Hirota, Kengo Katayama:
Design and Implementation of a DQN Based AAV. BWCCA 2020: 321-329 - [c28]Aoto Hirata, Tetsuya Oda, Nobuki Saito, Masaharu Hirota, Kengo Katayama:
A Coverage Construction Method Based Hill Climbing Approach for Mesh Router Placement Optimization. BWCCA 2020: 355-364 - [c27]Kyohei Toyoshima, Tetsuya Oda, Masaharu Hirota, Kengo Katayama, Leonard Barolli:
A DQN Based Mobile Actor Node Control in WSAN: Simulation Results of Different Distributions of Events Considering Three-Dimensional Environment. EIDWT 2020: 197-209 - [c26]Aoto Hirata, Tetsuya Oda, Nobuki Saito, Kazuho Kanahara, Masaharu Hirota, Kengo Katayama:
Approach of a Solution Construction Method for Mesh Router Placement Optimization Problem. GCCE 2020: 467-468 - [c25]Yuto Hirota, Tetsuya Oda, Nobuki Saito, Aoto Hirata, Masaharu Hirota, Kengo Katayama:
Proposal and Experimental Results of a DNN Based Real-Time Recognition Method for Ohsone Style Fingerspelling in Static Characters Environment. GCCE 2020: 476-477 - [c24]Yuki Nagai, Tetsuya Oda, Nobuki Saito, Aoto Hirata, Masaharu Hirota, Kengo Katayama:
Approach of a Japanese Co-Occurrence Words Collection Method for Construction of Linked Open Data for COVID-19. GCCE 2020: 478-479 - [c23]Takafumi Miyake, Kengo Katayama, Kazuho Kanahara, Tetsuya Oda:
Applying a Local Search for the Uncapacitated p-Median Problem to the Capacitated Problem. GCCE 2020: 835-836 - [c22]Nobuki Saito, Tetsuya Oda, Yuki Nagai, Kazuho Kanahara, Masaharu Hirota, Kengo Katayama:
Approach of Fuzzy Theory and Hill Climbing Based Recommender for Schedule of Life. LifeTech 2020: 368-369
2010 – 2019
- 2019
- [c21]Tetsuya Oda, Chiaki Ueda, Ryo Ozaki, Kengo Katayama:
Design of a Deep Q-Network Based Simulation System for Actuation Decision in Ambient Intelligence. AINA Workshops 2019: 362-370 - 2018
- [c20]Elis Kulla, Soushi Morita, Kengo Katayama, Leonard Barolli:
Route Lifetime Prediction Method in VANET by Using AODV Routing Protocol (AODV-LP). CISIS 2018: 3-11 - [c19]Kazuho Kanahara, Kengo Katayama, Takeshi Okano, Elis Kulla, Tetsuya Oda, Noritaka Nishihara:
A Restart Diversification Strategy for Iterated Local Search to Maximum Clique Problem. CISIS 2018: 670-680 - [c18]Tetsuya Oda, Elis Kulla, Kengo Katayama, Makoto Ikeda, Leonard Barolli:
A Deep Q-Network Based Simulation System for Actor Node Mobility Control in WSANs Considering Three-Dimensional Environment: A Comparison Study for Normal and Uniform Distributions. CISIS 2018: 842-852 - [c17]Takeshi Okano, Kengo Katayama, Kazuho Kanahara, Noritaka Nishihara:
A Local Search Based on Variant Variable Depth Search for the Quadratic Assignment Problem. GCCE 2018: 60-63 - 2017
- [c16]Hiroya Oda, Elis Kulla, Kengo Katayama:
A Modified Energy-Aware B.A.T.M.A.N Routing Protocol. NBiS 2017: 949-958 - 2016
- [c15]Kengo Katayama, Yusuke Okamoto, Elis Kulla, Noritaka Nishihara:
Variable Neighborhood Search Algorithms for the Node Placement Problem in Multihop Networks. BWCCA 2016: 631-638 - [c14]Jun Asatani, Yuya Kondo, Kengo Katayama, Elis Kulla, Hitoshi Tokushige:
An improved noisy gradient descent bit-flipping decoding algorithm for LDPC codes. ISITA 2016: 591-595 - 2015
- [c13]Elis Kulla, Ryo Ozaki, Akira Uejima, Hideyuki Shimada, Kengo Katayama, Noritaka Nishihara:
Real World Emergency Scenario Using MANET in Indoor Environment: Experimental Data. CISIS 2015: 336-341 - 2014
- [c12]Kengo Katayama, Yuto Akagi, Elis Kulla, Hideo Minamihara, Noritaka Nishihara:
New Kick Operators in Iterated Local Search Based Metaheuristic for Solving the Node Placement Problem in Multihop Networks. NBiS 2014: 141-148 - 2011
- [c11]Kengo Katayama, Akinori Kohmura, Keiko Kohmoto, Hideo Minamihara:
Memetic algorithm with strategic controller for the maximum clique problem. SAC 2011: 1062-1069
2000 – 2009
- 2007
- [c10]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 - [c9]Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihisa:
Iterated k-Opt Local Search for the Maximum Clique Problem. EvoCOP 2007: 84-95 - 2006
- [c8]Hiroyuki Narihisa, Takahiro Taniguchi, Mayumi Ohta, Kengo Katayama:
Exponential Evolutionary Programming Without Self-Adaptive Strategy Parameter. IEEE Congress on Evolutionary Computation 2006: 544-551 - [c7]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
- [j3]Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihisa:
An effective local search for the maximum clique problem. Inf. Process. Lett. 95(5): 503-511 (2005) - [c6]Hiroyuki Narihisa, Takahiro Taniguchi, Michiaki Thuda, Kengo Katayama:
Efficiency of Parallel Exponential Evolutionary Programming. ICPP Workshops 2005: 588-595 - [c5]Kengo Katayama, Takahiro Koshiishi, Hiroyuki Narihisa:
Reinforcement learning agents with primary knowledge designed by analytic hierarchy process. SAC 2005: 14-21 - 2004
- [c4]Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihisa:
Solving the maximum clique problem by k-opt local search. SAC 2004: 1021-1025 - 2001
- [j2]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) - [c3]Kengo Katayama, Hiroyuki Narihisa:
On fundamental design of parthenogenetic algorithm for the binary quadratic programming problem. CEC 2001: 356-363 - 2000
- [c2]Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa:
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm. GECCO 2000: 643-650
1990 – 1999
- 1999
- [j1]Kengo Katayama, Hisayuki Hirabayashi, Hiroyuki Narihisa:
Performance analysis for crossover operators of genetic algorithm. Syst. Comput. Jpn. 30(2): 20-30 (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 22:54 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:
