[1] : The Collaborative International Dictionary of English v.0.48

brute \brute\, a. f. brut, nasc., brute, fem., raw, rough,
   rude, brutish, l. brutus stupid, irrational: cf. it.  sp.
   bruto.
   1. not having sensation; senseless; inanimate; unconscious;
      without intelligence or volition; as, the brute earth; the
      brute powers of nature.
      1913 webster

   2. not possessing reason, irrational; unthinking; as, a brute
      beast; the brute creation.
      1913 webster

            a creature . . . not prone
            and brute as other creatures, but endued
            with sanctity of reason.              --milton.
      1913 webster

   3. of, pertaining to, or characteristic of, a brute beast.
      hence: brutal; cruel; fierce; ferocious; savage; pitiless;
      as, brute violence. --macaulay.
      1913 webster

            the influence of capital and mere brute labor.
                                                  --playfair.
      1913 webster

   4. having the physical powers predominating over the mental;
      coarse; unpolished; unintelligent.
      1913 webster

            a great brute farmer from liddesdale. --sir w.
                                                  scott.
      1913 webster

   5. rough; uncivilized; unfeeling. r.
      1913 webster

   brute force, the application of predominantly physical
      effort to achieve a goal that could be accomplished with
      less effort if more carefully considered. figuratively,
      repetitive or strenuous application of an obvious or
      simple tactic, as contrasted with a more clever stratagem
      achieving the same goal with less effort; -- as, the first
      prime numbers were discovered by the brute force
      repetition of the sieve of eratosthenes.
      pjc
see also:
brute force sieve of eratosthenes 

[2] : Moby Thesaurus II by Grady Ward, 1.0

73 moby thesaurus words for "brute force":
   amperage, armipotence, authority, beef, big battalions,
   black power, charge, charisma, clout, cogence, cogency, compulsion,
   dint, drive, duress, effect, effectiveness, effectuality, energy,
   flower power, force, force majeure, forcefulness, full blast,
   full force, influence, main force, main strength, mana, might,
   might and main, mightiness, moxie, muscle power, naked force,
   physical force, pizzazz, poop, potence, potency, potentiality,
   power, power pack, power structure, power struggle, powerfulness,
   prepotency, productiveness, productivity, puissance, pull, punch,
   push, rule of might, sinew, steam, steamroller, strength,
   strong arm, superiority, superpower, tyranny, ultima ratio,
   validity, vehemence, vigor, vim, virility, virtue, virulence,
   vitality, wattage, weight

[3] : Jargon File (4.3.1, 29 Jun 2001)

brute force adj. describes a primitive programming style, one in which
   the programmer relies on the computer's processing power instead of
   using his or her own intelligence to simplify the problem, often
   ignoring problems of scale and applying naive methods suited to small
   problems directly to large ones. the term can also be used in reference
   to programming style: brute-force programs are written in a heavyhanded,
   tedious way, full of repetition and devoid of any elegance or useful
   abstraction see also brute force and ignorance.

   the canonical example of a brute-force algorithm is associated with
   the `traveling salesman problem' tsp, a classical np-hard problem:
   suppose a person is in, say, boston, and wishes to drive to n other
   cities. in what order should the cities be visited in order to minimize
   the distance travelled? the brute-force method is to simply generate all
   possible routes and compare the distances; while guaranteed to work and
   simple to implement, this algorithm is clearly very stupid in that it
   considers even obviously absurd routes like going from boston to
   houston via san francisco and new york, in that order. for very small n
   it works well, but it rapidly becomes absurdly inefficient when n
   increases for n = 15, there are already 1,307,674,368,000 possible
   routes to consider, and for n = 1000 -- well, see bignum. sometimes,
   unfortunately, there is no better general solution than brute force. see
   also np-.

   a more simple-minded example of brute-force programming is finding the
   smallest number in a large list by first using an existing program to
   sort the list in ascending order, and then picking the first number off
   the front.

   whether brute-force programming should actually be considered stupid
   or not depends on the context; if the problem is not terribly big, the
   extra cpu time spent on a brute-force solution may cost less than the
   programmer time it would take to develop a more `intelligent' algorithm.
   additionally, a more intelligent algorithm may imply more long-term
   complexity cost and bug-chasing than are justified by the speed
   improvement.

   ken thompson, co-inventor of unix, is reported to have uttered the
   epigram "when in doubt, use brute force". he probably intended this as a
   ha ha only serious, but the original unix kernel's preference for
   simple, robust, and portable algorithms over brittle `smart' ones does
   seem to have been a significant factor in the success of that os. like
   so many other tradeoffs in software design, the choice between brute
   force and complex, finely-tuned cleverness is often a difficult one that
   requires both engineering savvy and delicate esthetic judgment.


see also:
brute force and ignorance canonical np- bignum ha ha only serious brittle 

[4] : The Free On-line Dictionary of Computing (27 SEP 03)

brute force
     
         a primitive programming style in which the
        programmer relies on the computer's processing power instead
        of using his own intelligence to simplify the problem, often
        ignoring problems of scale and applying naive methods suited
        to small problems directly to large ones.  the term can also
        be used in reference to programming style: brute-force
        programs are written in a heavy-handed, tedious way, full of
        repetition and devoid of any elegance or useful abstraction
        see also brute force and ignorance.
     
        the canonical example of a brute-force algorithm is
        associated with the "travelling salesman problem" tsp, a
        classical np-hard problem:
     
        suppose a person is in, say, boston, and wishes to drive to n
        other cities.  in what order should the cities be visited in
        order to minimise the distance travelled?
     
        the brute-force method is to simply generate all possible
        routes and compare the distances; while guaranteed to work and
        simple to implement, this algorithm is clearly very stupid in
        that it considers even obviously absurd routes like going
        from boston to houston via san francisco and new york, in that
        order.  for very small n it works well, but it rapidly
        becomes absurdly inefficient when n increases for n = 15,
        there are already 1,307,674,368,000 possible routes to
        consider, and for n = 1000 - well, see bignum.  sometimes,
        unfortunately, there is no better general solution than brute
        force.  see also np-complete.
     
        a more simple-minded example of brute-force programming is
        finding the smallest number in a large list by first using an
        existing program to sort the list in ascending order, and then
        picking the first number off the front.
     
        whether brute-force programming should actually be considered
        stupid or not depends on the context; if the problem is not
        terribly big, the extra cpu time spent on a brute-force
        solution may cost less than the programmer time it would take
        to develop a more "intelligent" algorithm.  additionally, a
        more intelligent algorithm may imply more long-term complexity
        cost and bug-chasing than are justified by the speed
        improvement.
     
        when applied to cryptography, it is usually known as brute
        force attack.
     
        ken thompson, co-inventor of unix, is reported to have
        uttered the epigram "when in doubt, use brute force".  he
        probably intended this as a ha ha only serious, but the
        original unix kernel's preference for simple, robust and
        portable algorithms over brittle "smart" ones does seem to
        have been a significant factor in the success of that
        operating system.  like so many other tradeoffs in software
        design, the choice between brute force and complex,
        finely-tuned cleverness is often a difficult one that requires
        both engineering savvy and delicate aesthetic judgment.
     
        jargon file
     
        1995-02-14
     
     
see also:
brute force and ignorance canonical travelling salesman problem np-hard bignum np-complete 
cryptography brute force attack ken thompson unix ha ha only serious 
kernel algorithms brittle operating system jargon file 

Brute Force >> B Words
Brute Force, definition of term: Brute Force
brute+force_pag1.html

Brute >> B Words
Brute, definition of term: Brute
brute_pag1.html

Force >> F Words
Force, definition of term: Force
force_pag1.html

Force Majeure >> F Words
Force Majeure, definition of term: Force Majeure
force+majeure_pag1.html

Force Field >> F Words
Force Field, definition of term: Force Field
force+field_pag1.html

Labor Force >> L Words
Labor Force, definition of term: Labor Force
labor+force_pag1.html

In Force >> I Words
In Force, definition of term: In Force
in+force_pag1.html

Coriolis Force >> C Words
Coriolis Force, definition of term: Coriolis Force
coriolis+force_pag1.html

Driving Force >> D Words
Driving Force, definition of term: Driving Force
driving+force_pag1.html

Brute Force Leather & Fallen Angel Fashions Online Store
...All images and designs Copyright © 2001-2005 Fallen Angel Fashions/Brute Force Leather Inc.....Fallen Angel Fashions&Brute ForceLeather..2005-2006..Corsetier Internationale..The..
http://www.bruteforceleather.com/, score=100, date indexed=October 5, 2005, 9:18 pm

Page 1 2 3 Next