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.
Review
2017
Review
2017
Each year, the treatment decisions for more than 230,000 breast cancer patients in the U.S. hinge on whether the cancer has… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Millimeter wave (mmWave) cellular systems will enable gigabit-per-second data rates thanks to the large bandwidth available at… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Brute force scanning of kernel memory images for finding kernel data structure instances is an important function in many… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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
Is this relevant?
Highly Cited
2002
Highly Cited
2002
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Abstract A computationally efficient solution to the problem of minimum error thresholding is derived under the assumption of… Expand
  • figure 1
  • figure 2
  • figure 7
  • figure 6
  • figure 8
Is this relevant?