Bazsites.com Algorithms
Directory Topics
On the Web
- Fast Line Drawing Algorithms by Po-Han Lin - Contains sources for graphical algorithms to draw lines. Included are the popular Bresenham algorithm, the Wu's Symmetric Double-Step, and the fastest non-cpu dependent algorithm, the Extremely Fast Line Algorithm (EFLA).
- (Australia) Bond University - School of Information Technology, Algorithms Group. The effective application of meta-heuristic search algorithms to intractable problems.
- Introduction to Genetic Algorithms - An introductory explanation of genetic algorithms available in HTML and PDF formats. The Genetic Algorithm Viewer Java applet shows the functioning of a genetic algorithm.
- Andrija Radovic´'s Algorithms - Several unique algorithms for fast and optimal computations with integer numbers and graphics suitable for hardware implementation: dividing, square rooting, line drawing, ellipse drawing, Haiku plot routine.
- Stony Brook Algorithm Repository - This is a collection of implementations for 75 fundamental algorithms problems, including data structures, numerical and combinatorial algorithms,graph algorithms, and computational geometry. Implementations are available in C++, Java, Fortran, and other languages.
- OOPWeb Algorithms Directory - Algorithms lecture notes, courses, tutorials, references, guides and online books.
- ALGO 2003 - Comprising: ESA 2003 (11th Annual European Symposium on Algorithms); WABI 2003 (3rd Workshop on Algorithms in Bioinformatics); ATMOS 2003 (Algorithmic Methods and Models for Optimization of Railways); WAOA 2003 (Workshop on Approximation and Online Algorithms). Budapest, Hungary; 15--20 September 2003.
- Sort Algorithms Visualizer - Applet and web site for teaching sort algorithms. Includes animation of 11 algorithms and some in-depth studies.
- R.Mukundan::Java Applets Center - Illustration computer graphics algorithms, computer vision algorithms, computational geometry algorithms, data structures and algorithms.
- Sorting Algorithms Visualized - Applet visualizing various sorting algorithms, English version of Peter Weigel and Andreas Boltzmann applet.
Wikipedia Articles
- Dictionary of Algorithms and Data Structures - The Dictionary of Algorithms and Data Structures is a dictionary style reference for many algorithms, "algorithmic techniques", "archetypal problems" and data structures found in the field of Computer Science http://www.nist.
- Cache algorithms - In computing, cache algorithms (also frequently called replacement algorithms or replacement policies) are optimizing instructions – algorithms – that a computer program or a hardware-maintained structure can follow to manage a cache of information stored on the computer. Cache size is usually limited, and if the cache is full, the algorithm must choose which items ...
- Divide-and-conquer eigenvalue algorithm - Divide-and-conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa 1990s) become competitive in terms of stability and efficiency with more traditional algorithms such as the QR algorithm. The basic concept behind these algorithms is of course the famous divide-and-conquer approach from computer science.
- Algorithms for calculating variance - Algorithms for calculating variance play a minor role in statistical computing. A key problem in the design of good algorithms for this problem is that formulas for the variance may involve sums of squares, which can lead to numerical instability as well as to arithmetic overflow when dealing with large values.
- Lock-free and wait-free algorithms - In contrast to algorithms that protect access to shared data with locks, lock-free and wait-free algorithms are specially designed to allow multiple threads to read and write shared data concurrently without corrupting it. "Lock-free" refers to the fact that a thread cannot lock up: every step it takes brings progress to the system.