default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyo Kuroiwa 0002
Person information
- unicode name: 黒岩稜
- affiliation: University of Toronto, ON, Canada
- affiliation: The University of Tokyo, Graduate School of Arts and Sciences, Japan
Other persons with the same name
- Ryo Kuroiwa 0001 — The University of Tokyo, Graduate School of Information Science and Technology, Japan
- Ryo Kuroiwa 0003 — The University of Kitakyushu, Fukuoka, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Ryo Kuroiwa, J. Christopher Beck:
Parallel Beam Search Algorithms for Domain-Independent Dynamic Programming. AAAI 2024: 20743-20750- [i3]Ryo Kuroiwa, J. Christopher Beck:
Domain-Independent Dynamic Programming. CoRR abs/2401.13883 (2024) - 2023
- [c14]Ryo Kuroiwa
, J. Christopher Beck:
Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization. ICAPS 2023: 236-244 - [c13]Ryo Kuroiwa, J. Christopher Beck:
Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search. ICAPS 2023: 245-253 - [c12]Alexander Shleyfman, Ryo Kuroiwa, J. Christopher Beck:
Symmetry Detection and Breaking in Linear Cost-Optimal Numeric Planning. ICAPS 2023: 393-401 - [c11]Ryo Kuroiwa, J. Christopher Beck:
Large Neighborhood Beam Search for Domain-Independent Dynamic Programming. CP 2023: 23:1-23:22 - [c10]Ryo Kuroiwa, Alexander Shleyfman, J. Christopher Beck:
Extracting and Exploiting Bounds of Numeric Variables for Optimal Linear Numeric Planning. ECAI 2023: 1332-1339 - [c9]Ryo Kuroiwa:
Domain-Independent Dynamic Programming (Student Abstract). SOCS 2023: 192-193 - [i2]Yu Liu, Ryo Kuroiwa, Alex Fukunaga:
Learning Search-Space Specific Heuristics Using Neural Networks. CoRR abs/2306.04019 (2023) - 2022
- [j1]Ryo Kuroiwa, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, J. Christopher Beck:
The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions. J. Artif. Intell. Res. 75: 1477-1548 (2022) - [c8]Ryo Kuroiwa, Alexander Shleyfman, J. Christopher Beck:
LM-Cut Heuristics for Optimal Linear Numeric Planning. ICAPS 2022: 203-212 - [c7]Ryo Kuroiwa, J. Christopher Beck:
Biased Exploration for Satisficing Heuristic Search. ICAPS 2022: 213-221 - [i1]Ryo Kuroiwa, J. Christopher Beck:
Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization. CoRR abs/2211.14409 (2022) - 2021
- [c6]Ryo Kuroiwa, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, J. Christopher Beck:
LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions. ICAPS 2021: 210-218 - 2020
- [c5]Ryo Kuroiwa, Alex Fukunaga:
Analyzing and Avoiding Pathological Behavior in Parallel Best-First Search. ICAPS 2020: 175-183 - [c4]Ryo Kuroiwa, Alex Fukunaga:
Front-to-Front Heuristic Search for Satisficing Classical Planning. IJCAI 2020: 4098-4105
2010 – 2019
- 2019
- [c3]Ryo Kuroiwa, Alex Fukunaga:
On the Pathological Search Behavior of Distributed Greedy Best-First Search. ICAPS 2019: 255-263 - [c2]Ryo Kuroiwa, Alex Fukunaga:
A Case Study on the Importance of Low-Level Algorithmic Details in Domain-Independent Heuristics. SOCS 2019: 180-181 - 2018
- [c1]Ryo Kuroiwa, Alex Fukunaga:
Batch Random Walk for GPU-Based Classical Planning. ICAPS 2018: 155-160
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-08-01 20:14 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:
