Skip to main content
. Author manuscript; available in PMC: 2011 May 27.
Published in final edited form as: Adv Neural Inf Process Syst. 2008;20:1216–1225.

Algorithm 1.

AEMS: Anytime Error Minimization Search

Function SEARCH(t, ε)
Static: T: an AND-OR tree representing the current search tree.
t0 ← TIME()
while TIME() – t0t and not SOLVED(ROOT(T), ε) do
b*(T)
 EXPAND(b*)
 UPDATEANCESTORS(b*)
end while
return argmaxaA LT (ROOT(T), a)