Przybylski, M. (2018). AD-Cut: A Search-Tree Cutting Anytime Dynamic A Algorithm. Proceedings of the International Conference on Automated Planning and Scheduling, 28, 494-499. https://doi.org/10.1609/icaps.v28i1.13925
Chicago Style (17th ed.) CitationPrzybylski, Maciej. "AD-Cut: A Search-Tree Cutting Anytime Dynamic A Algorithm." Proceedings of the International Conference on Automated Planning and Scheduling 28 (2018): 494-499. https://doi.org/10.1609/icaps.v28i1.13925.
MLA (9th ed.) CitationPrzybylski, Maciej. "AD-Cut: A Search-Tree Cutting Anytime Dynamic A Algorithm." Proceedings of the International Conference on Automated Planning and Scheduling, vol. 28, 2018, pp. 494-499, https://doi.org/10.1609/icaps.v28i1.13925.
Warning: These citations may not always be 100% accurate.