algorithmic techniques
1Algorithmic composition — is the technique of using algorithms to create music.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 …
2Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… …
3Algorithmic trading — In electronic financial markets, algorithmic trading or automated trading, also known as algo trading, black box trading, or robo trading, is the use of computer programs for entering trading orders with the computer algorithm deciding on certain …
4Parallel Random Access Machine — In computer science, Parallel Random Access Machine (PRAM) is a shared memory abstract machine. As its name indicates, the PRAM was intended as the parallel computing analogy to the random access machine (RAM). In the same way, that the RAM is… …
5Gene family — A gene family is a set of several similar genes, formed by duplication of a single original gene, and generally with similar biochemical functions. One such family are the genes for human haemoglobin subunits; the ten genes are in two clusters on …
6List of Guggenheim Fellowships awarded in 2004 — U.S. and Canadian Fellows* Thomas A. Abercrombie, Associate Professor of Anthropology, New York University: Social climbing, self narrative, and modernity in the Spanish transatlantic world, 1550 1808. * Amir D. Aczel, Science Writer, Brookline,… …
7Approximation algorithm — In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems. Approximation algorithms are often associated with NP hard problems; since it is unlikely that there …
8Dictionary of Algorithms and Data Structures — 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.[1] The dictionary is maintained… …
9Ukkonen's algorithm — In 1995, Esko Ukkonen proposed a linear time, online algorithm for constructing suffix trees that has come to be known as Ukkonen s algorithm.The algorithm begins with an implicit suffix tree containing the first character of the string. Then it… …
10Zonal Informatics Olympiad — The Zonal Informatics Olympiad is the first of the three stages of the Indian Computing Olympiad, or ICO. The ICO selects approximately 30 students for a National level camp, the International Olympiad in Informatics Training Camp, from where 4… …
