1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2024
Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
Takumi Shimoda, Alex Fukunaga
Parallelization of non-admissible search algorithms such as GBFS poses a challenge because straightforward parallelization can result in search behavior which significantly deviate…
cs.AI2024
Decoupling Generation and Evaluation for Parallel Greedy Best-First Search(extended version)
Takumi Shimoda, Alex Fukunaga
In order to understand and control the search behavior of parallel search, recent work has proposed a class of constrained parallel greedy best-first search algorithms which only e…
cs.LO2021★ 1 cited
Symbolic Automatic Relations and Their Applications to SMT and CHC Solving
Takumi Shimoda, Naoki Kobayashi, Ken Sakayori +1
Despite the recent advance of automated program verification, reasoning about recursive data structures remains as a challenge for verification tools and their backends such as SMT…