Open Source Algorithms - Page 31

This repository implements Steven Fortune’s algorithm (sweep-line method) for generating Voronoi diagrams in JavaScript, providing a performant browser-side solution for computational geometry of planar point sets. With this library you can feed a set of sites (points) and compute their Voronoi cells – the partition of the plane into regions closest to each site – in O(n log n) time. It’s especially useful in web UIs, visualizations, interactive maps, and generative-art contexts where you need dynamic tessellations or diagrammatic layouts. The library exposes API functions for computing cells, retrieving neighbors, and drawing results into canvas or SVG. Because it is pure JavaScript and self-contained, it integrates easily with browser or Node.js applications without heavy dependencies. For developers exploring spatial algorithms, generative UI, or interactive diagrams, this codebase is a practical reference and tool to build upon.

An optimized java library for genetic algorithms. The library is designed to be fast and memory light, but still very easy to use.

http://jocdelavida.piposerver.com - Online implementation of Conway's Game of the Life 0 players game, but using entities based on the nature, like animals or plants who born, grow up, reproduces breed and die. Written in Java 6 and Adobe Flex 3.

This is an image coder with fixed sampling, at a rate of up to 24 images per second (on XC2V1000-4 @ 40 MHz with res. up to 352x288).

Joshua chess robot: a stepper motor robot interfaced with a photosensible board to play chess with an embedded artificial intelligence, a game database or and internet player. Software, robot photos, tech papers, schematics and cabling included. Enjo

An online judge system to judge the ACM-ICPC programming contests.

An implementation of "k-Way Merging" as described in "Fundamentals of Data Structures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/

K-automaton is a new parsing (syntactic analysis) machine isomorphous to language. Implemented in Java. Can generate Java code from grammars described in EBNF.

Implementation of K-means algorithm on Cell Broadband Engine

KACTL (the KTH Algorithmic Contest Template Library) is an extensively curated and high-performance C++ algorithms library created by the competitive programming team at the Royal Institute of Technology (KTH) to serve as a trusted, battle-tested codebase for algorithmic contests, programming competitions, and general algorithm development. The repository aggregates dozens of concise implementations of essential data structures, numerical methods, graph algorithms, string processing tools, computational geometry routines, and optimization techniques, all designed with speed, correctness, and compactness in mind. Instead of reinventing algorithms on the fly during contests like ACM-ICPC or Codeforces rounds, competitors can import exactly the component they need — whether a segment tree with lazy propagation, a minimum cost flow solver, or a fast Fourier transform — and focus their energy on problem logic and strategy.

An enhanced Simulator based on Agent Grid Repast.It has some bugs cleared from Agent Grid Repast and has enhanced features on Group Selection Policy.

Der KND Decoder konvertiert die lästigen Zahlenwerte, in den Java Dateien vom Knuddels Applet, zu lesbaren Strings. Die neue dekodier Methode wurde auch beachtet, die den HuffmanString etc. konvertiert.

A Visual Studio .NET C++ application can perform machine learning using genetic algorithm, naive bayes, KNN, and Artificial Neural Networks (ANNs) read and processed from any standard ARFF.

KaHaShEr is an application to check the integrity of a file using MD5, SHA1, SHA256 and SHA512 checksum. Designed to be smart and easy to use, it includes a feature that can detect a hexadecimal value in the clipboard and automatically perform the verification while notifying you with a very expressive sound of the outcome of this verification.

Kalman Filter book using Jupyter Notebook. Focuses on building intuition and experience, not formal proofs. Includes Kalman filters,extended Kalman filters, unscented Kalman filters, particle filters, and more. All exercises include solutions. Introductory text for Kalman and Bayesian filters. All code is written in Python, and the book itself is written using Juptyer Notebook so that you can run and modify the code in your browser. What better way to learn? This book teaches you how to solve all sorts of filtering problems. Use many different algorithms, all based on Bayesian probability. In simple terms Bayesian probability determines what is likely to be true based on past information. This book is interactive. While you can read it online as static content, it's better to use it as intended. It is written using Jupyter Notebook, which allows you to combine text, math, Python, and Python output in one place.

The project contains algorithms for locating the most central groups in complex networks. In particular implementations of various centrality measures and heuristic search algorithms. All functionality is exposed via XML-RPC for easier exploitation.

This is an algorithm which can be used to find multiple key strings in an text only scanning the text one time. It is a very good algorithm.

Kinyosoft AutoUpdate is a module to incorporate to a system with which we will be able to deposit the functionality of exhausts route web. Doing that our system turns out to be more amicable, with major functionality and scalability

A markup language for expressing knitting patterns which can serve as a software interchange format

A public domain C data structure library, with an emphasis on collections. Currently includes dynamic arrays and lists.

This program aims to check and gain a inner point from multiple set of linear constraints. This software works better in the case that range of variables are known and parameters are configured so. C++ and Eigen library needed, and to calculate more accurate, we may need mpfr++ library or, QD library. Freezed.

Korat is a tool for constraint-based generation of structurally complex test inputs for Java programs.

An ANSI C library of routines for rapid signal detection based on higher order statistical analysis.

L2 is a data structures library. Featured are self balancing BSTs and self balancing BST backed sequences, in memory B-trees and B-tree backed sequences, pointer sets, radix and critical bit trees. A few articles about L2 data structures and more here: https://dsxxi.home.blog/

LAITOR is a text mining software developed to find co-occurrence of biological entities (gene/protein terms) together with biointeractions and concepts term from customized dictionaries.