The following publications are possibly variants of this publication:
- Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search AlgorithmsRichard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto. aips 2010: 177-184 [doi]
- Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search AlgorithmsRichard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto. socs 2010: 157-158 [doi]
- Bounded Suboptimal Search: A Direct Approach Using Inadmissible EstimatesJordan Tyler Thayer, Wheeler Ruml. IJCAI 2011: 674-679 [doi]
- Faster than Weighted A*: An Optimistic Approach to Bounded Suboptimal SearchJordan T. Thayer, Wheeler Ruml. aips 2008: 355-362
- Probably bounded suboptimal heuristic searchRoni Stern, Gal Dreiman, Richard Anthony Valenzano. ai, 267:39-57, 2019. [doi]
- Bounded Suboptimal Game Tree SearchDor Atzmon, Roni Stern, Abdallah Saffidine. socs 2018: 10-18 [doi]
- Using Alternative Suboptimality Bounds in Heuristic SearchRichard Anthony Valenzano, Shahab Jabbari Arfaee, Jordan Tyler Thayer, Roni Stern, Nathan R. Sturtevant. aips 2013: [doi]
- Dynamic Potential Search - A New Bounded Suboptimal SearchDaniel Gilon, Ariel Felner, Roni Stern. socs 2016: 36-44 [doi]