Takuma Udagawa, Aashka Trivedi, et al.
EMNLP 2023
class of search algorithms for locahng the root of a function is devised and studied. Each member of the class of algorithms is globally convergent as m the classical method of binary search However, the class contains members of higher order of convergence as well. These higher order methods require the existence of bounds on derivatives of the function whose root is sought and they proceed by exploiting these bounds. © 1975, ACM. All rights reserved.
Takuma Udagawa, Aashka Trivedi, et al.
EMNLP 2023
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
Cristina Cornelio, Judy Goldsmith, et al.
JAIR
Segev Shlomov, Avi Yaeli
CHI 2024