Augment Aug*ment", v. t. [imp. & p. p. {Augmented}; p. pr. & vb. n. {Augmenting}.] [L. augmentare, fr. augmentum an increase, fr. augere to increase; perh. akin to Gr. ?, ?, E. wax, v., and eke, v.: cf. F. augmenter.] 1. To enlarge or increase in size, amount, or degree; to swell; to make bigger; as, to augment an army by re["e]forcements; rain augments a stream; impatience augments an evil. [1913 Webster]

But their spite still serves His glory to augment. --Milton. [1913 Webster]

2. (Gram.) To add an augment to. [1913 Webster]

The Collaborative International Dictionary of English. 2000.

Look at other dictionaries:

  • augmenting — praplėtimas statusas T sritis automatika atitikmenys: angl. augmenting; expansion; extension vok. Erweiterung, f rus. расширение, n pranc. extension, f …   Automatikos terminų žodynas

  • augmenting — n. increasing, multiplying aug·ment || ɔːg ment v. increase, enlarge, enhance; multiply …   English contemporary dictionary

  • augmenting — …   Useful english dictionary

  • augmenting augmentative building — increasing increasing adj. 1. becoming greater or larger; as, increasing prices. [Narrower terms: {accretionary ; {augmenting, augmentative, building ; {expanding ; {flared, flaring ; {growing ; {incorporative ; {lengthening ; {maximizing ;… …   The Collaborative International Dictionary of English

  • Neuroevolution of augmenting topologies — (NEAT) is a genetic algorithm for the generation of evolving artificial neural networks (a neuroevolution technique) developed by Ken Stanley in 2002 while at The University of Texas at Austin. It alters both the weighting parameters and… …   Wikipedia

  • Hopcroft–Karp algorithm — The Hopcroft–Karp algorithm finds maximum cardinality matchings in bipartite graphs in O(sqrt{V} E) time, where V is the number of vertices and E is the number of edges of the graph. [John E. Hopcroft, Richard M. Karp: An n^{5/2} Algorithm for… …   Wikipedia

  • Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and …   Wikipedia

  • Dinic's algorithm — is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz. The algorithm runs in O(V2E) time and is similar to the Edmonds–Karp algorithm,… …   Wikipedia

  • Archetype (album) — Infobox Album | Name = Archetype Type = studio Artist = Fear Factory Released = April 20 2004 Recorded = October−December, 2003 Genre = Industrial metal Groove metal Length = 59:00 Label = Liquid 8 Producer = Fear Factory Reviews = *Allmusic… …   Wikipedia

  • Archetype (Fear Factory album) — Archetype Studio album by Fear Factory Released April 19, 2004 …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”