Academic Thesis

Basic information

Name Katayama Kengo
Belonging department
Occupation name
researchmap researcher code 1000253656
researchmap agency Okayama University of Science

Title 

最大クリーク問題に対する探索頻度情報にもとづく反復k-opt局所探索法の性能

					

					

						

							

								

									
Bibliography　Type 

									
								

							

						

						

					

					

						

							

								

									
Author 

									
								

							

						

						
金原一歩, 片山謙吾, 富田悦次, 松崎空良

					

					

						

							

								

									
Summary 

									
								

							

						

						



					

					

						

							

								

									
Magazine(name) 

									
								

							

						

						
第109回人工知能基本問題研究会

					

					

						

							

								

									
Publisher 

									
								

							

						

						

					

					

						

							

								

									
Volume 

									
								

							

						

						

					

					

						

							

								

									
Number Of Pages 

									
								

							

						

						

					

					

						

							

								

									
StartingPage 

									
								

							

						

						

					

					

						

							

								

									
EndingPage 

									
								

							

						

						

					

					

						

							

								

									
Date of Issue 

									
								

							

						

						
2019/03

					

					

						

							

								

									
Referee 

									
								

							

						

						

					

					

						

							

								

									
Invited 

									
								

							

						

						

					

					

						

							

								

									
Language 

									
								

							

						

						
Japanese

					

					

						

							

								

									
Thesis　Type 

									
								

							

						

						
Research papers (research meetings, symposium materials and others)

					

					

						

							

								

									
ISSN 

									
								

							

						

						

					

					

						

							

								

									
DOI 

									
								

							

						

						

					

					

						

							

								

									
NAID 

									
								

							

						

						

					

					

						

							

								

									
PMID 

									
								

							

						

						

					

					

						

							

								

									
URL 

									
								

							

						

						

					

					

						

							

								

									
J-GLOBAL ID 

									
								

							

						

						

					

					

						

							

								

									
arXiv ID 

									
								

							

						

						

					

					

						

							

								

									
ORCID Put Code 

									
								

							

						

						

					

					

						

							

								

									
DBLP ID