Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,294 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
(a,b)-tree
Array data structure
Artificial intelligence
Backjumping
Expand
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
Broderick Crawford
,
Ricardo Soto
,
É. Monfroy
,
W. Palma
,
Carlos Castro
,
F. Paredes
Expert systems with applications
2013
Corpus ID: 42501676
2012
2012
Dynamic selection of enumeration strategies for solving constraint satisfaction problems
Broderick Crawford
,
Carlos Castro
,
É. Monfroy
,
Ricardo Soto
,
W. Palma
,
F. Paredes
2012
Corpus ID: 6760221
The main goal concerning Constraint Satisfaction Problems is to determine a value assignment for variables satisfying a set of…
Expand
2010
2010
Elixir: A new bandwidth-constrained mapping for Networks-on-chip
M. Reshadi
,
A. Khademzadeh
,
Akram Reza
IEICE Electronics Express
2010
Corpus ID: 15460592
Nowadays, with technology shrinking and the huge demand for supporting multiple applications has led designers to use multiple IP…
Expand
2009
2009
On Identifying and Managing Relationships in Multi-Agent Systems
Xiaoxun Sun
,
W. Yeoh
,
Sven Koenig
International Joint Conference on Artificial…
2009
Corpus ID: 55105742
Incremental search algorithms reuse information from previous searches to speed up the current search and are thus often able to…
Expand
2008
2008
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints
J. Jaffar
,
A. Santosa
,
R. Voicu
AAAI Conference on Artificial Intelligence
2008
Corpus ID: 6242253
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed…
Expand
2008
2008
Proof systems for the coalgebraic cover modality
M. Bílková
,
A. Palmigiano
,
Y. Venema
Advances in Modal Logic
2008
Corpus ID: 14273427
We investigate an alternative presentation of classical and pos- itive modal logic where the coalgebraic cover modality is taken…
Expand
2006
2006
A/sup */ search: an efficient and flexible approach to materialized view selection
G. Gou
,
J. Yu
,
Hongjun Lu
IEEE Transactions on Systems Man and Cybernetics…
2006
Corpus ID: 9494172
Decision support systems issue a large number of online analytical processing (OLAP) queries to access very large databases. A…
Expand
2006
2006
Hybrid POMDP Algorithms
Sébastien Paquet
,
B. Chaib-draa
,
Stéphane Ross
2006
Corpus ID: 14128092
When an agent evolves in a partially observable environment, it has to deal with uncertainties when choosing its actions. An…
Expand
Highly Cited
2001
Highly Cited
2001
Refined Search Tree Technique for Dominating Set on Planar Graphs 1
J. Alber
,
H. Fernau
,
R. Niedermeier
,
Hongbing Fan
,
M. Fellows
,
Frances A. Rosamond
2001
Corpus ID: 3978714
We establish a refined search tree technique for the parameterized Dominating Set problem on planar graphs. Here, we are given an…
Expand
1992
1992
A High Performance OR-parallel Prolog System
R. Karlsson
1992
Corpus ID: 59822203
P ROLOG, the most popular logic programming language, has been developed for single-processor computers. The implementations of…
Expand
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)
ACCEPT & CONTINUE