worst-case method

  • 61Affine arithmetic — (AA) is a model for self validated numerical analysis. In AA, the quantities of interest are represented as affine combinations (affine forms) of certain primitive variables, which stand for sources of uncertainty in the data or approximations… …

    Wikipedia

  • 62chromatography — chromatographer, n. chromatographic /kreuh mat euh graf ik, kroh meuh teuh /, adj. chromatographically, adv. /kroh meuh tog reuh fee/, n. Chem. the separation of mixtures into their constituents by preferential adsorption by a solid, as a column… …

    Universalium

  • 63Generating trigonometric tables — In mathematics, tables of trigonometric functions are useful in a number of areas. Before the existence of pocket calculators, trigonometric tables were essential for navigation, science and engineering. The calculation of mathematical tables was …

    Wikipedia

  • 64P versus NP problem — Unsolved problems in computer science Is P = NP ? …

    Wikipedia

  • 65DFA minimization — In computer science, more specifically in the branch of automata theory, DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has minimum number of states. Here, two DFAs are called …

    Wikipedia

  • 66Overclocking — For other uses, see Overclocked. AMD Athlon XP overclocking BIOS setup on ABIT NF7 S. Front side bus frequency (external clock) has increased from 133 MHz to 148 MHz, and the clock multiplier factor has changed from 13.5 to 16.5… …

    Wikipedia

  • 67Randomized algorithm — Part of a series on Probabilistic data structures Bloom filter · Skip list …

    Wikipedia

  • 68Computer cooling — An OEM AMD heatsink mounted onto a motherboard. Computer cooling is required to remove the waste heat produced by computer components, to keep components within their safe operating temperature limits. Various cooling methods help to improve… …

    Wikipedia

  • 69Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… …

    Wikipedia

  • 70Interval arithmetic — Interval arithmetic, also called interval mathematics , interval analysis , and interval computation , is a method in mathematics. It has been developed by mathematicians since the 1950s and 1960s as an approach to putting bounds on rounding… …

    Wikipedia