Takanori Maehara (Ph.D.)
Title
Unit Leader
Introduction
[CLOSED]
We study the theory of discrete optimization. Discrete optimization problems are problems of finding the optimal solution from a finite number of candidates. Since many human decision making can be formulated in this form, solving discrete optimization problems is a fundamental technology in artificial intelligence. Ideally, discrete optimization problems can be solved by examining all candidates. However, when the number of candidates is huge due to the combinatorial explosion, it is impossible to examine all candidates in a realistic time. For such problems, we design an efficient algorithm with theoretical guarantee by using discrete convex analysis, graph theory, etc.
Main Research Field
Computer Science
Research Field
Mathematics
Research Subjects
Discrete Optimization
Graph Theory
Numerical Analysis
Graph Theory
Numerical Analysis
Laboratory Website URL
Poster(s)
- FY2019 Research Results (Japanese version)
- FY2018 Research Results (Japanese version)
Related posts
posted on October 2, 2020 09:00Information
posted on July 16, 2020 15:15Information
posted on May 28, 2020 15:00Information
posted on November 15, 2019 14:00Information
posted on September 11, 2019 12:00Information
posted on August 8, 2019 10:45Information
posted on March 29, 2019 14:27Award
posted on March 18, 2019 18:33Award
posted on November 16, 2018 17:18Information
posted on September 7, 2018 17:55Information
posted on July 10, 2018 13:30Seminar
posted on April 11, 2018 16:28Award
