Difference between revisions of "Ayumu Nagai"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 29: | Line 29: | ||
<references /> | <references /> | ||
'''[[People|Up one level]]''' | '''[[People|Up one level]]''' | ||
| − | [[Category:Shogi Programmer| | + | [[Category:Shogi Programmer|Nagai]] |
| − | [[Category:Researcher| | + | [[Category:Researcher|Nagai]] |
Revision as of 17:27, 16 November 2019
Ayumu Nagai,
a Japanese computer scientist and professor at the department of computer science at Gunmma University.
His research interests include artificial intelligence and software verification.
He holds a M.Sc. and Ph.D. from University of Tokyo on depth-first and-or tree search algorithms, in particular depth-first Proof-number search,
and was member of Hiroshi Imai's research laboratory [1].
In the 90s, along with Yasushi Tanase, Akihiro Kishimoto and Norifumi Gotou, Ayumu Nagai was co-author of the Shogi program ISshogi [2] [3], multiple winner and top finisher of CSA tournaments [4] and Computer Olympiads.
Contents
Selected Publications
1998 ...
- Ayumu Nagai (1998). A new AND/OR Tree Search Algorithm Using Proof Number and Disproof Number. Complex Games Lab Workshop, Tsukuba
- Ayumu Nagai (1999). A New Depth-First-Search Algorithm for AND/OR Trees. M.Sc. thesis, University of Tokyo
- Ayumu Nagai, Hiroshi Imai (1999). Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees. Proceedings of the Korea-Japan Joint Workshop on Algorithms and Computation
- Ayumu Nagai, Hiroshi Imai (1999). Application of df-pn+ to Othello endgames. 5th Game Programming Workshop » Othello
2000 ...
- Ayumu Nagai (2002). Df-pn Algorithm for Searching AND/OR Trees and Its Applications. Ph.D. thesis, University of Tokyo
- Ayumu Nagai, Hiroshi Imai (2002). Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees. [IEICE transactions on information and systems IEICE transactions on information and systems]
- Sonoko Moriyama, Ayumu Nagai, Hiroshi Imai (2002). Fast and Space-efficient Algorithms for Deciding Shellability of Simplicial Complexes of Large Size using h-Assignments. ICMS 2002
- Ayumu Nagai (2007). Inappropriateness of the criterion of k-way normalized cuts for deciding the number of clusters. Pattern Recognition Letters, Vol. 28, No. 15
2010 ...
- Yuta Kanuki, Naoya Ohta, Ayumu Nagai (2013). Automatic Compensation of Radial Distortion by Minimizing Entropy of Histogram of Oriented Gradients. ACPR 2013
