brute force programming

(redirected from Brute-force search)
Also found in: Medical, Wikipedia.

brute force programming

Programming a solution to a problem by using the most straightforward method. However, it is typically not a very elegant solution or one that is flexible for future changes, but it gets the job done. The proverbial brute force programming example is creating the most efficient and least costly route for visiting multiple venues and returning home ("the traveling salesman problem"). Brute force programming tests every possible routing combination; whereas other mathematical algorithms obtain the results more quickly when the number of venues is large. See hard coded. See also brute force attack.
References in periodicals archive ?
Then the attackers do brute-force search for the value of [DELTA][A.sup.36.sub.j] to deduce [A.sup.36.sub.j], where j [member of] {0,1,5,6}.
My view is that traditional brute-force search is a steam-powered vehicle inside a Bugatti Veyron Super Sport.
The results of the algorithm are compared with the optimal results obtained through a brute-force search. The algorithm efficiency is defined as the ratio of the throughput achieved through the use of the algorithm to the throughput achieved through the brute-force search.
There are a wide range of visual tracking techniques in the practice ranging from edge feature based to region based tracking, and brute-force search methods to differential approaches.
Someone with the right cracker dictionaries could plug in your flash drive and let the brute-force search functions of the lists look for your particular password.
Unfortunately, native implementations of brute-force search are very inefficient for several reasons.
So it is to chess knowledge, not brute-force search, we must look for most of the improvement.