Open Source Algorithms - Page 65

Web-Service for discrete dynamic systems' model description and simulation. Firstly, recursive procedures of stochastic optimization are added. The framework for open and closed loop model description and simulation.

Red-Black Maps and Trees, written in Java. These Classes try to advoid the overhead produced by Sun's implementations. For example Trees are just Trees, nor self mapped Maps. Access on nodelevel is possible, reducing overhead while iterating over an map

reputron is a knowledge extraction engine platform that covers all aspect of text mining, relevance, indexing and querying on a corpus of text documents.

A Ring-Buffer instance could be used with element types - char - long - long long - void* . Focus is on a hardened SW structure with buffer-instance-pointer check (not very fast but more secure). Some features are globally choosable on compile-time (e.g. switch multithread support off completely to have faster access). Note: User Interface is for Test and Tutor Code only.

Welcome to rose algorithms this library include some important algorithms by Ali Abdul Ghani(ali miracle) mail: blade.vp2020@gmail.com License: lgpl

This project provides IEEE 802.1d Rapid Spanning Tree Protocol (RSTP) in Linux Kernel. The project is based on the existing ethernet bridging functionality in Linux Kernel.

Random Thoughts On Distributed Algorithms: a collection of tools and ideas for the development of distributed applications. The first released part is an RxRPC security model based on OpenSSL and elliptic curve criptography. Please check docs for info...

The project implements the concept of signals and queues in the environment .NET.

This project is no longer supported by its creators. salgo is a C framework you can use to implement sorting algorithms. It provides different ways of filling an array and then sorting this in ascending or descending order (a stop watch is included).

Meaningful acronym and name generator from a list of keywords provided by the user. The software checks that the random words generated exist in the specified language by checking against a spelling engine publicy available as a web service

scikit-opt is a Python library for solving optimization problems with evolutionary and swarm-intelligence algorithms. It includes genetic algorithms, particle swarm optimization, differential evolution, simulated annealing, ant colony optimization, immune algorithms, and artificial fish swarms. The package can address continuous objectives, constrained problems, and combinatorial tasks such as the traveling salesman problem. A consistent workflow lets users define an objective, configure an optimizer, run iterations, and inspect the best solution. Genetic algorithm operators can be replaced through user-defined functions or subclassing. Runs may continue from earlier iterations instead of restarting. Vectorization, threading, multiprocessing, caching, examples, and plotting support help users experiment with performance and convergence.

Simple Collection of Algorithms

SCOPE stands for Symbolic COmputation Parallel Environment. We aim at providing an environment for symbolic computation, that is easily expandable, easy to use, parallel, effective and free.

The first stage of development is do write a tool to anonymize packet capture files captured with libpcap. After that we will be integrating this with tcpdump to anonymize in real-time and analyze and look for its effect on different IDS's.

sdf4j is a Java framework to manipulate Static Dataflow graphs (SDF).

a first work algorithm trials to implement a compromise between distributed and centralized version control system.part of research project,it's only a simulation. no real networking is implemented ,only virtual random signal are imaginary produced.

Name of Project: ShabdaShilpa OS : Linux License : GPL Language : C++ based on Qt Description : An Editor Which can translate English words to Kannada This Editor has the Capabilit

shareOI is an open-source educational repository that collects presentation slides and learning materials for competitive programming and algorithm contests. It organizes resources into categories covering fundamental algorithms, data structures, graph theory, dynamic programming, strings, mathematics, and computational geometry. Most materials are provided in Chinese and target students preparing for programming competitions. The collection includes PDF and PowerPoint presentations contributed by educators and competitive programmers. Additional resources provide problem solutions and discussions of advanced algorithmic techniques. Its directory structure allows learners to browse materials by subject and difficulty. The repository welcomes community contributions and links to complementary learning platforms. It serves as a reference library rather than an executable software application.

Shears is a C# library for list processing, combinatorial problems, and functional programming. It is intended to be useful for everyday coding, with an emphasis on producing brief, readable code. It's also lots of fun!

This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.

The simpliZia-program implements the simplex-algorithm and is designed to help students of Operations Research to understand and learn the algorithm. This is a german project, source and program are actually written in german.

Dead lock free locking library.

spGAL is a C++ Genetic Algorithm (GA) library. This is a portable scalable, and easy to use library written with ANSI C++.

This application implement an approach for doing keyword based search over semi-structured data available in HTML pages.