Learn More
This paper proposes a new search algorithm, denoted PN * , for AND/OR tree search. The algorithm is based on proof-number (PN) search, a best-first search algorithm, proposed by Allis et al. PN * combines several existing ideas. It transforms a best-first PN-search algorithm into an iterative-deepening depth-first approach. Moreover, it is enhanced by(More)
An AND/OR graph represents the problem-solving process of reducing the given problem to more simple ones in a field of Artificial Intelligence. For the problems with enormous search space, it is important to avoid combinatorial explosions by useful heuristic functions. The AO* algorithm, which outputs the optimal solution in an AND/OR graph, is widely(More)
AIMS Right ventricular (RV) systolic dysfunction has been shown to be an independent predictor of clinical outcome in patients with chronic heart failure (CHF), and cardiac metaiodobenzylguanidine (MIBG) imaging also provides prognostic information. We aimed to evaluate the long-term predictive value of combining RV systolic dysfunction and abnormal(More)
  • 1