Skip to search formSkip to main contentSkip to account menu

Brute-force search

Known as: Brute force search, Uninformed search, Brute force key search 
In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique that… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
This paper addresses the problem of generating possible object locations for use in object recognition. We introduce selective… 
Highly Cited
2009
Highly Cited
2009
Differential evolution (DE) is an efficient and powerful population-based stochastic search technique for solving optimization… 
Highly Cited
2008
Highly Cited
2008
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as… 
Highly Cited
2004
Highly Cited
2004
DNA micro-arrays now permit scientists to screen thousands of genes simultaneously and determine whether those genes are active… 
Highly Cited
2004
Highly Cited
2004
The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered… 
Review
2004
Review
2004
High data rate wireless communications, nearing 1 Gb/s transmission rates, is of interest in emerging wireless local area… 
Highly Cited
2004
Highly Cited
2004
A classical model is used for the power consumption of cryptographic devices. It is based on the Hamming distance of the data… 
Highly Cited
1998
Highly Cited
1998
We present two algorithms for the approximate nearest neighbor problem in high-dimensional spaces. For data sets of size n living… 
Highly Cited
1986
Highly Cited
1986
Review
1984
Review
1984
Concerns about computational problems requiring brute-force or exhaustive search methods have gained particular attention in…