You are currently offline. Some features of the site may not work correctly.

# And–or tree

Known as: And-or tree, And/or tree
An and–or tree is a graphical representation of the reduction of problems (or goals) to conjunctions and disjunctions of subproblems (or subgoals).
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
• IJCAI
• 2015
• Corpus ID: 16418278
Automatic algorithm configurators are important practical tools for improving program performance measures, such as solution time… Expand
2014
2014
• IEEE 28th International Parallel and Distributed…
• 2014
• Corpus ID: 7674039
The processing of queries expressed as trees of boolean operators applied to predicates on sensor data streams has several… Expand
2013
2013
• ICALP
• 2013
• Corpus ID: 12252578
We establish a generic form of hardness amplification for the approximability of constant-depth Boolean circuits by polynomials… Expand
2011
2011
• 49th Annual Allerton Conference on Communication…
• 2011
• Corpus ID: 15667334
In this paper, we introduce non-uniform compressive sensing (NCS), a novel compressive sensing (CS) technique that enables non… Expand
Highly Cited
2011
Highly Cited
2011
• EvoApplications
• 2011
• Corpus ID: 7127136
This paper investigates the applicability of Genetic Programming type systems to dynamic game environments. Grammatical Evolution… Expand
2008
2008
• TQC
• 2008
• Corpus ID: 6106794
We present a bounded-error quantum algorithm for evaluating Min - Max trees with $N^{\frac{1}{2}+o(1)}$ queries, where N is the… Expand
2003
2003
• EPIA
• 2003
• Corpus ID: 16191642
Logic Programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very… Expand
2000
2000
A conceptual scheme for the interpretation of physiographic regions, developed in an earlier effort, is formalized and programmed… Expand
Highly Cited
1998
Highly Cited
1998
• SODA '98
• 1998
• Corpus ID: 12884104
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools… Expand
1994
1994
• 1994
• Corpus ID: 2491666
This paper studies tail bounds on supercritical branching processes with nite distributions of oospring. Given a nite… Expand