Open Source Algorithms - Page 20

Sample implementation of multi-shift BiCGstab(ell) inverters, single-pass, double-pass and pseudo-double-pass as published in PoS of Lattice 2010.

A simple rendering, image processing engine. Includes a framework width (multiplatform) event handling, plugin management, a templated based math library and some exotic features like general linear camera, gpu based (OpenGL) image process...

DualPipe is a bidirectional pipeline parallelism algorithm open-sourced by DeepSeek, introduced in their DeepSeek-V3 technical framework. The main goal of DualPipe is to maximize overlap between computation and communication phases during distributed training, thus reducing idle GPU time (i.e. “pipeline bubbles”) and improving cluster efficiency. Traditional pipeline parallelism methods (e.g. 1F1B or staggered pipelining) leave gaps because forward and backward phases can’t fully overlap with communication. DualPipe addresses that by scheduling micro-batches from both ends of the pipeline in a bidirectional fashion—i.e. some micro-batches flow forward while others flow backward—so that computation on one partition can coincide with communication for another.

A teachable/trainable artificially intelligent music bot fundamentally inspired by how the new wave band Duran Duran composes music. This program utilizes many algorithmic/AI techniques/processes, including machine learning; which allow you to teach/train it to compose music which you prefer... and the technique which is the foundation of the design of DuranDuranbot, which was directly inspired by how Duran Duran writes music........ Called, "bit by bit circular composition"....... and it's explanation can be found here - https://scsynth.org/t/bit-by-bit-circular-composition/1107 This program is written in the SuperCollider programming language - https://en.wikipedia.org/wiki/SuperCollider Contact - ken_brant@ymail.com

Dwifft is a small Swift library that tells you what the "diff" is between two collections, namely, the series of "edit operations" required to turn one into the other. It also comes with UIKit bindings, to automatically, animatedly keep a UITableView/UICollectionView in sync with a piece of data by making the necessary row/section insertion/deletion calls for you as the data changes. Dwifft is a Swift library that does two things. The first thing sounds interesting but perhaps only abstractly useful, and the other thing is a very concretely useful thing based off the first thing. It can help you build a substantially better user experience if you have table/collection views with dynamic content in your app. There is some non-trivial index math inside of this diff algorithm that is easy to screw up. Dwifft has 100% test coverage on all of its core algorithms.

(New version 1.04 is released) Dynamic Arrays is a set of useful very fast classes for data manipulating in memory. Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). Give it a try and let me know how it works.

FM-index is a compressed text index appeared in 2000 (http://pizzachili.dcc.uchile.cl/indexes/FM-indexV2/). A recent algorithm allows to update a FM-index (http://dx.doi.org/10.1016/j.jda.2009.02.007). Here, you'll find the implementation.

E-w0rm : is a powerfull shell with handy features like : file manager , password change , database manager , bind shell , remote shell , remote upload , edit , chmod , delete , make , autoroot , php code execution , server command execution , process manager ... You can also change theme ! And " E-w0rm " brought to you by : Epic Hackers S.C Scan : https://goo.gl/718BkD

EASEA (EAsy Specification of Evolutionary Algorithms: pronounce "easy") is a high-level language dedicated to the specification of evolutionary algorithms. EASEA up to version 0.7 compiles .ez specification files into C++ or JAVA object files.

An EBCDIC To Ascii Converter and Vice Versa. Couldn't find one on the web so did this one.

Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and. Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments demonstrate that the proposed method performs promisingly for well-known benchmark problems in the term of optimization accuracy.

Evolutionary Structural Optimization Package (ESOP) consists of software for viewing, analyzing, and optimizing structures containing beam, truss, and membrane plate elements utilizing OpenGL and the Genetic Algorithm (GA). Created for use in M.S. theses

ESRGAN stands for Enhanced Super-Resolution Generative Adversarial Network and is a foundational project in the field of deep learning-based image super-resolution. It builds on earlier GAN-based approaches by improving network architecture (e.g., using Residual-in-Residual Dense Blocks), adversarial loss functions, and perceptual loss components to generate higher-fidelity high-resolution images from low-resolution inputs with more realistic textures and details. ESRGAN was originally developed as part of research efforts that won benchmarks such as the PIRM2018 super-resolution challenge, demonstrating that GAN-based techniques can produce visually convincing results that surpass traditional interpolation or earlier deep approaches. The repository provides the core testing and model definitions, allowing researchers and practitioners to reproduce results, experiment with pretrained models, and integrate ESRGAN into broader pipelines or applications.

Calculates the shortest path between a group of EVE-Online solar systems that contain assets.

A concise example of the classical genetic algorithm, with a fancy windows terminal display. Features DNA editing, save/load, customizable constraints and statistics logging.

The EXT Library is set of various useful classes, templates and macros that extend functionality provided by ISO C++ (ext sub-library), standard C and C++ library (lib), to abstract parts of Windows API (win) and access PE file resources (res).

EZvolve Foundation Classes is a set of data types and utility classes for use with evolutionary algorithms. Currently implemented support for bit string encoding, populations, fitnesses, fitness functions, probabilities, and probability vectors.

This application can create any year calendar after the year 1759. Special feature: => Calendar creation in mass.

ehcp for Ubuntu is a hosting control panel, for multiple domains on single machine. easily installable,easy usage, non-complex,functional. homepage:http://www.ehcp.net * automatically installs and works: dns, apache, mysql, ftp, email, domains,auto updat

This is meant to be a powerful, but easy to use math software. It's by the user and for the users.

EasyGenetic is a highly efficient C++ framework for genetic master-slave algorithms. It heavily makes use of template metaprogramming to provide a fully customizable environment that accommodates most of user's needs without sacrificing efficiency.

The package edmonds-alg contains a C++-implementation of Edmonds's optimum branching algorithm as described by Tarjan in 1977.

An OpenGL GUI for the inspection and segmentation of 3D surface meshes

EightQueens is a simple chess puzzle written in Java. Click one square on the chess board to start recursive function. Fill the chess board with eight queens.

First of all: this program is totally useless. But those of you who know and love the classic computer game "Elite" will maybe like it. The "Elite Planet Browser" is a little program for various classic Z80-based computers, written in C using the z88dk compiler (www.z88dk.org). It allows you to browse through the planet data of the Elite game on many old Z80-based computers. When the original game came out in 1984, many people wondered how it is possible to have detailed data of so many planets in the 16K RAM memory of the BBC Micro. The trick behind this is a clever algorithm based on a pseudo-random number sequence, and this algorithm is reproduced here in this program. Currently, 85 target systems are supported, including Sinclair ZX81, Jupiter Ace, ColecoVision, MSX, Tandy TRS-80, Sharp MZ, and many more. 2026-03-08: - New targets supported: Epson PX-4/PX-8 Mitsubishi Multi 8 Sanyo MBC-200/1200 Sharp PC-G850 Tandy TRS-80 M2 TIM-011 Triumph Adler P2 Xerox 820