Algorithms used earlier in the history of cryptography are substantially different from modern methods, and modern ciphers can be classified according to how they operate and whether they use one or two keys.

* Genetic Algorithms Computer programs that " evolve " in ways that resemble natural selection can solve complex problems even their creators do not fully understand An excellent introduction to GA by John Holland and with an application to the Prisoner's Dilemma

Algorithms that perform optimization tasks ( such as building cladograms ) can be sensitive to the order in which the input data ( the list of species and their characteristics ) is presented.

Algorithms can also separately shade vertices, and interpolate the lighting value of the vertices when drawing pixels.

Algorithms for vector processors are usually different than those for scalar processors since they can process multiple instructions and / or multiple data elements in parallel ( for examples of these differences see ' description ' in the main article ).

Algorithms have been designed so that the calculations done in a preceding time step can be reused in the current time step, resulting in faster algorithms.

Warriors can also be generated by Genetic Algorithms or Genetic Programming.

Algorithms ( or, at the very least, formal sets of rules ) have been used to compose music for centuries ; the procedures used to plot voice-leading in Western counterpoint, for example, can often be reduced to algorithmic determinacy.

Algorithms can either 1 ) provide notational information ( sheet music ) for other instruments or 2 ) provide an independent way of sound synthesis ( playing the composition by itself ).

* A simple explanation of Gibbs sampling can be found on pp. 370 – 371 of Prof. MacKay's book " Information Theory, Inference, and Learning Algorithms ", available for free browsing here or here.

* Algorithms ( competition length about 2 hours ): Competitors are given a set ( usually three ) of algorithmic problems and have 75 minutes to correctly solve as many as they can.

Algorithms such as above can be represented as a recurrence relation.

* Strategy pattern: Algorithms can be selected on the fly

A summary of his research up to 1998 can be found in the article " Philippe Flajolet's research in Combinatorics and Analysis of Algorithms " by H. Prodinger and W. Szpankowski, Algorithmica 22 ( 1998 ), 366-387.

* Evolutionary Algorithms Demos – There are some applets with Evolution Strategies and Genetic Algorithms that the user can manipulate to solve problems.

Algorithms can also be divided by their domain: frequency or space domain.

Algorithms must be able to compensate for all the variables that can affect the ANPR's ability to produce an accurate read, such as time of day, weather and angles between the cameras and the license plates.

Algorithms can also be used to route data to data centers where electricity is less expensive.

Algorithms using divide and conquer can reduce the number considerably to bring the number of cuts down to about.

Algorithms may also be trivially modified to have good best-case running time by hard-coding solutions to a finite set of inputs, making the measure almost meaningless.

</ br > Cryptographic Hash Algorithms ( 256-bit or larger digests are to be preferred in new designs.

KASUMI was designed for 3GPP to be used in UMTS security system by the Security Algorithms Group of Experts

Algorithms for finding strongly connected components may be used to solve 2-satisfiability problems ( systems of Boolean variables with constraints on the values of pairs of variables ): as showed, a 2-satisfiability instance is unsatisfiable if and only if there is a variable v such that v and its complement are both contained in the same strongly connected component of the implication graph of the instance.

Algorithms that seek to predict discrete labels tend to be derived by adding partial supervision to a clustering algorithm.

Algorithms that seek to predict continuous labels tend to be derived by adding partial supervision to a manifold learning algorithm.

Algorithms appear to be based on linear feedback shift registers, perhaps with some non-linear elements thrown in to make them more difficult to cryptanalyze.

Algorithms that compute extractor ( and disperser ) graphs have found many applications in computer science.

In computer science, Algorithms for Recovery and Isolation Exploiting Semantics, or ARIES is a recovery algorithm designed to work with a no-force, steal database approach ; it is used by IBM DB2, Microsoft SQL Server and many other database systems.

Algorithms for ICA include infomax, FastICA, and JADE, but there are many others.

Algorithms with linear speedup and algorithms running on a single processor have an efficiency of 1, while many difficult-to-parallelize algorithms have efficiency such as that approaches zero as the number of processors increases.

Algorithms for resolving co-reference tend to have accuracy in the 75 % range ( as with many linguistic tasks, there is a tradeoff between precision and recall ).

The Dictionary of Algorithms and Data Structures is a dictionary style reference for many of the algorithms, algorithmic techniques, archetypal problems and data structures found in the field of computer science.

In his Book of Algorithms on Practical Arithmetic, John of Seville provides one the earliest known descriptions of Indian positional notation, whose introduction to Europe is usually associated with the book Liber Abaci by Fibonacci:

* The on-line textbook: Information Theory, Inference, and Learning Algorithms, by David MacKay, contains chapters on elementary error-correcting codes ; on the theoretical limits of error-correction ; and on the latest state-of-the-art error-correcting codes, including low-density parity-check codes, turbo codes, and fountain codes.

* Cam. ac. uk, On-line textbook: " Information Theory, Inference, and Learning Algorithms " by David MacKay-giving an entertaining and thorough introduction to Shannon theory, including state-of-the-art methods from coding theory, such as arithmetic coding, low-density parity-check codes, and Turbo codes.

* On-line textbook: Information Theory, Inference, and Learning Algorithms, by David MacKay, gives an accessible introduction to Shannon theory and data compression, including the Huffman coding and arithmetic coding.

* Networking – Algorithms and protocols for reliably communicating data across different shared or dedicated media, often including error correction.

* Variational Algorithms for Approximate Bayesian Inference, by M. J. Beal includes comparisons of EM to Variational Bayesian EM and derivations of several models including Variational Bayesian HMMs ( chapters ).

* Sorting Algorithms ( including Stooge sort )

It is important to realise that EGT is not just a specialist mathematical treatment of animal contests to determine their dynamics and results, but in a manner similar to the field of Evolutionary Algorithms, it is a comprehensive model that encompasses the Darwinian process itself – including the central tenets of competition ( the game ) natural selection ( replicator dynamics ) and heredity-all within the overall model.

The team subsequently embarked on a plan to create and sell mathematics libraries, including the General Graph Facilities library ( GGF ) and the Computational Geometry Library ( CGL ), under the name of the Center for Digital Algorithms.

* NIST Dictionary of Algorithms and Data Structures entry, including pointers to several implementations: http :// www. nist. gov / dads / HTML / nysiis. html

* On-line textbook: Information Theory, Inference, and Learning Algorithms, by David MacKay, has a chapter on codes for integers, including an accessible introduction to Elias codes.