Open Source Algorithms - Page 58

GDTTLA aims to be a comprehensive yet easy to use, stable IDE for the TLA+ tools.

Gearbox provides a collection of usable peer-reviewed robotics-related libraries. Gearbox is not an integration framework. Rather, it provides a set of implementations, without insisting on a standard API, for use by any number of existing frameworks.

Application to automatically merge gedcom files. It provides either a user or another program the ability to merge gedcom files with as little human interaction as possible and with high quality of matching results.

To identify cancer-related genes

A .net implementation of a framework for genetic algorithms. This tool enables programmers to write the "core" of their problem and have a genetic algorithm immediately setup for solving it.

Genijatorics is a library providing solutions to enumerative combinatorial problems. The most prominent example of its use is for generating events in specified date range from CRON-like descriptions. It also serves for educational purposes.

Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.

http://code.google.com/p/geometry/

Attempt to create a PHP-framework: component-oriented; with global DI-container; for micro-services and also for big module-builded projects; with its own ORM. Little demo: http://complex.php.gi.igor-gilman.de.

GLARE is a library and a software for product based optimization of reagent lists in the context of a chemical combinatorial library design. Large virtual combinatorial libraries containing 10^12 products have been optimized within a second.

glint is a tool facilitating you in development of state-oriented control entities which supposed to be used in very broad areas of programming (e.g. state-oriented network protocols). glint saves you from pondering how your finite state machine should be organized, how many states it should have and what they should mean. You just tell glint how you would like your control entity to operate and glint returns to you the synthesised magic black box which implements the desired logic. Also glint can tell you in regexp style which event sequences your FSM can handle and which are forbidden for it.

go-algorithms is an open-source educational repository that provides implementations of common algorithms and data structures written in the Go programming language. The project is designed primarily as a learning resource to help developers understand how fundamental computer science concepts can be implemented idiomatically in Go. It includes a wide range of classic sorting, searching, and numerical algorithms alongside basic collection structures such as stacks, queues, linked lists, and binary trees. The repository is organized into clear directories by topic, making it easy for learners to explore specific categories of algorithms. Because the code focuses on clarity over heavy abstraction, it is especially useful for students and developers studying algorithmic fundamentals. Overall, go-algorithms serves as a practical reference and study companion for Go programmers building a strong foundation in data structures and algorithm design.

libGo is a C++ class library containing all kinds of things that proved useful to me. Included are: - Linear algebra, using LAPACK and CBLAS - V4L(1) image grabber - Multithreading - Image containers (up to 3D) - Some simple optimisation code - Python embedding helper - Matlab interface - .. and other things, have a look at the HTML documentation! golib grew over many years, things I had use for have been added now and then. Some parts are better taken care of than others. If you find anything spectacularly wrong or badly documented, and need assistance, please drop me a line.

An extremely memory-efficient hash_map implementation. 2 bits/entry overhead! The SparseHash library contains several hash-map implementations, including implementations that optimize for space or speed.

A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc.

Porting of the core simulation portions of smoldyn to the GPU, using CUDA

Interface to deal with graphs ( Adjacency list representation ) written in C... Only basic operations available now, soon to be more =) Small project to college, not much implemented yet...

GraphSmart is a collection of graph data structures and algorithms utilizing generics and the Microsoft .NET 2.0 Framework. Included items are commonly used in software engineering but not included in the .NET 2.0 Framework class library.

This library is a common implementation of both the Open Grid Forum GridRPC API _and_ GridRPC API Data Management standards. It is completely modular and already supports middleware modules for DIET and Ninf, as well as data manager modules for iRods, OwnCloud, rsync, scp. The installation is made easy with cmake and testing examples can be launched in a one line command.

The gruft library is a fast implementation of several cryptographic functions in JavaScript: MD5, SHA-1, SHA-256, Tiger/192, AES-Rijndael.

The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.

** MOVED: to github.com/gundermanc/gundercrypt A CLI text ciphering program and library written in java that makes use of pseudo random numbers and a password (provided by the user) to generate encrypted text by selectively shifting each subsequent letter by a pseudo-random index, encoding it as a letter stored in a hidden position within the String, and then re shifting the encrypted String again by numeric values deduced from a password to provide a dual layer of security. Easily can be imported into any java project or run via shell commands.

It is useful to understand how hamming coding running is in network layer on TCP/IP protocol [TÜRKÇE] OSI ve TCP/IP de ağ katmanında kullanılan hamming kodlamasının nasıl işlediğini gösteren eğitim amaçlı bir uygulamadır.

C++ implementation of Hash Array Mapped Trie (HAMT). Class design follows STL principles and aims to meet the requirements and to provide the guarantees of std::hash_map.

Headrand is a static library wrote in c that contains functions to simulate complex systems or make statistical analysis with a new approach called "random function computing"