Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 3
Highly Cited
2009
Highly Cited
2009
Differential evolution (DE) is an efficient and powerful population-based stochastic search technique for solving optimization… Expand
  • figure 1
  • figure 2
  • table II
  • table III
  • table IV
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… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Highly Cited
2004
Highly Cited
2004
The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
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… Expand
  • figure 1
  • figure 2
  • figure 3
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… Expand
  • figure 1
Highly Cited
1998
Highly Cited
1998
This paper presents a method for robot motion planning in dynamic environments. It consists of selecting avoidance maneuvers to… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 5
Highly Cited
1995
Highly Cited
1995
Abstract This paper proposes a robust approach to image matching by exploiting the only available geometric constraint, namely… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1994
Highly Cited
1994
Abstract : This paper reports on a meta-analytic integration of the relation between group cohesiveness and performance. Overall… Expand
  • table 1
  • table 2
Highly Cited
1992
Highly Cited
1992
The polygon remains a popular graphics primitive for computer graphics application. Besides having a simple representation… Expand