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. [Artificial Intelligence 66 (1) (1994) 91–124], and on Korf’s RBFS algorithm [Artificial Intelligence 62 (1) (1993) 41–78]. PN∗ combines several existing ideas. It transforms a best-first PN-search algorithm ...

Breadth-first and depth-first search are basic search strategies upon which many other search algorithms are built. In this paper, we describe an approach to integrating these two strategies in a single algorithm that combines the complementary strengths of both. We show the benefits of this approach using the treewidth problem as an example.

In this paper we discuss our practical experiences with the use of different search strategies in functional logic programs. In particular, we show that complete strategies, like breadth-first search or iterative deepening search, are a viable alternative to incomplete strategies, like depth-first search, that have been favored in the past for logic programming languages.

A data depth is one of the most important concepts of nonparametric multivariate analysis. Several depth functions have been introduced since 1980. The halfspace depth is probably the most popular. This depth function has many desirable properties (they are stated in the general definition of statictical depth function). We show a way of generalization of the halfspace depth finding a broader c...

In their recent paper, Muir et al. (Science, 2015, 348, 1135-1138) demonstrate that the maximum depths of staghorn coral assemblages are shallower at higher latitudes, a trend that correlates with winter light levels. Based on these findings, the authors hypothesize that light availability limits the current latitudinal extent of the group and will constrain future range expansion. Here we rean...

We present AIM2-F , an improved implementation of AIM-F [4] algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the efficiency of the mining task. We have presented AIM-F at FIMI’03, a combination of some techniques into an algorithm which utilize those techniques dynamically according to the input dataset. The algorithm main featur...

We introduce and consider the problem of effectively organizing a population of workers of varying abilities. We assume that arriving tasks for the workforce are homogeneous, and that each is characterized by an unknown and onedimensional difficulty value x ∈ [0, 1]. Each worker i is characterized by their ability wi ∈ [0, 1], and can solve the task if and only if x ≤ wi. If a worker is unable ...

We introduce depth-first search with dynamic decomposition for counting the solutions of a binary CSP completely. In particular, we use the method for computing the number of minimal energy structures for model proteins.

We present a new algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the efficiency of the mining task. We integrate a combination of these techniques into an algorithm which utilize those techniques dynamically according to the input dataset. The algorithm main features include depth first search with vertical compressed database, ...

In this paper we take a general look at forward pruning in tree search. By identifying what we think are desirable characteristics of pruning heuristics, and what attributes are important for them to consider, we hope to understand better the shortcomings of existing techniques, and to provide some additional insight into how they can be improved. We view this work as a first step towards the g...