brute-force search


Also found in: Encyclopedia, Wikipedia.

brute-force search

A popular term for an inelegant and inefficient search for data, with no useful abstraction or curating.
References in periodicals archive ?
So the remaining 8 bits of WK;[parallel]WK15 could only be derived by the brute-force search.
The time complexity of brute-force search for one fault injection is
Unfortunately the brute-force search approach described above is only feasible for small Ramsey numbers.
We close this section by remarking that although the brute-force search approach considered here is very primitive and certainly not interesting of its own accord, it is nevertheless a useful validation mechanism for results uncovered by other search techniques.
Unfortunately, native implementations of brute-force search are very inefficient for several reasons.
The traditional approach to brute-force search is analogous to shipping the entire haystack to your office, only to throw most of it away.
So it is to chess knowledge, not brute-force search, we must look for most of the improvement.