Ryo Kuroiwa

Orcid: 0000-0002-3753-1644

Affiliations:
  • University of Toronto, ON, Canada
  • The University of Tokyo, Graduate School of Arts and Sciences, Japan


According to our database1, Ryo Kuroiwa authored at least 18 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Domain-Independent Dynamic Programming.
CoRR, 2024

Parallel Beam Search Algorithms for Domain-Independent Dynamic Programming.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Learning Search-Space Specific Heuristics Using Neural Networks.
CoRR, 2023

Domain-Independent Dynamic Programming (Student Abstract).
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Extracting and Exploiting Bounds of Numeric Variables for Optimal Linear Numeric Planning.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Large Neighborhood Beam Search for Domain-Independent Dynamic Programming.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

Symmetry Detection and Breaking in Linear Cost-Optimal Numeric Planning.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions.
J. Artif. Intell. Res., 2022

LM-Cut Heuristics for Optimal Linear Numeric Planning.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Biased Exploration for Satisficing Heuristic Search.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021
LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020
Front-to-Front Heuristic Search for Satisficing Classical Planning.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Analyzing and Avoiding Pathological Behavior in Parallel Best-First Search.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019
A Case Study on the Importance of Low-Level Algorithmic Details in Domain-Independent Heuristics.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

On the Pathological Search Behavior of Distributed Greedy Best-First Search.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
Batch Random Walk for GPU-Based Classical Planning.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018


  Loading...