Skip to search formSkip to main contentSkip to account menu

Search algorithm

Known as: Informed search, Keyword Search Method, Searching algorithm 
In computer science, a search algorithm is an algorithm that retrieves information stored within some data structure. Data structures can include… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AI winterAlpha–beta pruningApache UIMABeam stack search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems
Highly Cited
2009
Highly Cited
2009
Sample Average Approximation for Stochastic Dominance Constrained Programs
In this paper we study optimization problems with second-order stochastic dominance constraints. This class of problems has been… 
Highly Cited
2007
Highly Cited
2007
Efficient Handling of N-gram Language Models for Statistical Machine Translation
Statistical machine translation, as well as other areas of human language processing, have recently pushed toward the use of… 
Highly Cited
2006
Highly Cited
2006
A new construction of 64-QAM golay complementary sequences
In this correspondence, we present a new construction for 64-QAM Golay sequences of length n=2/sup m/ for integer m. The peak… 
Highly Cited
2004
Highly Cited
2004
Silicon complexity for maximum likelihood MIMO detection using spherical decoding
Multiple-input multiple-output (MIMO) wireless systems increase spectral efficiency by transmitting independent signals on… 
Highly Cited
2000
Highly Cited
2000
A robust method to obtain optimal and sub-optimal design and retrofit solutions of water utilization systems with multiple contaminants in process plants
Highly Cited
1998
Highly Cited
1998
Binary Pseudorandom Sequences of Period 2n-1 with Ideal Autocorrelation
In this correspondence, we present five new classes of binary sequences of period 2/sup n/-1 with ideal autocorrelation. These… 
Highly Cited
1992
Highly Cited
1992
Optimal normal bases
Let K ⊂ L be a finite Galois extension of fields, of degree n. Let G be the Galois group, and let (<α)<∈G be a normal basis for L… 
Highly Cited
1978
Highly Cited
1978
The contour extraction problem with biomedical applications
Highly Cited
1972
Highly Cited
1972
A production implementation of an associative array processor: STARAN
  • J. Rudolph
  • AFIPS '72 (Fall, part I)
  • 1972
  • Corpus ID: 17467900
The associative or content-addressed memory has been an attractive concept to computer designers ever since Slade and McMahon's… 
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)