Skip to search formSkip to main contentSkip to account menu

Search tree

Known as: Search tree property 
In computer science, a search tree is a tree data structure used for locating specific keys from within a set. In order for a tree to function as a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

23 relations
(a,b)-treeArray data structureArtificial intelligenceBackjumping

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization
2008
2008
Proof systems for the coalgebraic cover modality
We investigate an alternative presentation of classical and pos- itive modal logic where the coalgebraic cover modality is taken… 
2006
2006
A/sup */ search: an efficient and flexible approach to materialized view selection
Decision support systems issue a large number of online analytical processing (OLAP) queries to access very large databases. A… 
Highly Cited
2001
Highly Cited
2001
Conditional progressive planning under uncertainty
In this article, we describe a possibilistic/ probabilistic conditional planner called PTLplan. Being inspired by Bacchus and… 
2001
2001
On a Tabling Engine That Can Exploit Or-Parallelism
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to… 
Highly Cited
1993
Highly Cited
1993
Automatic Generation of Some Results in Finite Algebra
This is a report of the application of the Model Generation Theorem Prover developed at ICOT to problems in the theory of finite… 
Highly Cited
1993
Highly Cited
1993
Object-Oriented Programming Using C++
This book is an excellent start for the professional programmer who wants to master C++ for use in an object-oriented environment… 
1992
1992
A High Performance OR-parallel Prolog System
P ROLOG, the most popular logic programming language, has been developed for single-processor computers. The implementations of… 
1985
1985
A General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects
Highly Cited
1983
Highly Cited
1983
An algorithm for optimal two-dimensional compaction of VLSI layouts
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)