brute-force search

(redirected from Brute force search)

brute-force search

A popular term for an inelegant and inefficient search for data, with no useful abstraction or curating.
References in periodicals archive ?
This important property helps to do brute force search for computing [A.sup.l+l' - 1.sub.12] in next step.
Step 3: Brute force search. The nonzero elements in one column of [DELTA][A.sup.l+l' - 1.sub.12] are denoted as ([DELTA][a.sup.l+l' - 1.sub.12,y], [DELTA][a.sup.l+l' - 1.sub.12,d+y], [DELTA][a.sup.l+l' - 1.sub.12,2d+y], ***, [DELTA][a.sup.l+l' - 1.sub.12,(d-1)d+y]), where 0 [less than or equal to] y [less than or equal to] d - 1.
The attacker does brute force search for [A.sup.l+l'-1.sub.12] and derives the candidates set of
This important property helps to do brute force search on [DELTA][A.sup.l-2.sub.12].
The time complexity of brute force search for one fault injection is
For this brute force search, we used a DNN architecture similar to the aforementioned DNN.
The heatmap in Figure 3 shows the resolutions as obtained from the residual distributions corresponding to using only one PMT for training and determining the vertex location of the antineutrino IBD interaction using the brute force search. Specifically, the resolution pertaining to using each PMT is indicated by a value from the color scale.
Using an Nvidia Tesla P40 GPU, we estimated that it would take about 60 days to complete the entire residual curve with the brute force search, whereas it took about one day to complete with the bottleneck DNN.
The results have been compared with a random PMT search and a brute force search which yields the ideal result.
Organizations worldwide have learned that brute force search does not meet most users' needs when looking for information in an organization's digital files.
The other method involved a multi-stage, adaptive brute force search. Neither method is efficient, computationally, but that is not a primary requirement for a reference algorithm.
At a panel session, "Computer Chess: What remains?" John Stanback, creator of Sarkov, noted that selective searches are really pruned, brute force searches. It was also noted that artificial intelligence-oriented approaches to computer chess have been somewhat disappointing.