Open Source Windows Algorithms - Page 35

The Rank Aggregation and Evaluation Suite is a comprehensive set of rank aggregation algorithms and performance measurement tools for use in research.

A collection of algorithms for querying a set of documents and returning the ones most relevant to the query. The most common use case for these algorithms is, as you might have guessed, to create search engines.

The rating algorithms library contains various algorithms used to accurately rank, score or rate collections of similar data. One example is the ranking of votes based on a 5 star scale. This project started as a need of ordering data based on the relevance of each record obtained from users. The first algorithm implemented is based on Wilson Score Interval.

AnalyzerTask for calculating the rate popularity for ContentObjects integrated into the iQser GinServer. Developed by niPRO-Project.

Framework for building event-driven applications based on the reactor pattern.

A Fast MAC based 3D Free surface fuid solver. Capable also of simulating viscoelastic fluids.Includes also wave equation solver for simulating shallow water phenomena.

AleRBTree C# generic class for manipulating and navigating red black tree

Delphi class incapsulating functionality of Red-black binary search tree

A fully functional red-black tree implemented in C++/CLI with an OO approach of naming and structuring which makes the code highly readable as well as easily portable to C# or Java. The package also includes a binary search tree and two traversal algorithms.

Red/Black Tree implementation. Port of the sourceforge libredblack library to C#. The package also consists of mutlitree (tree with non-unique key) and tree with quick direct access to items by the index.

Multi-platform regular expression (regex) creation. Highlights regex matches, and regex groups for quick regular expression creation. Save/load regular expression sessions. Create robust regex patterns on any major platform. Supports PCRE and wxRegEx.

Regexp testing tool allows to apply group of regexps to huge arrays of data (millions or so) in order to investigate search or search/replacement possibilities of regexp group.

Prosta klasa w c# zawierająca zestaw metod pozwalających na sprawdzenie poprawności podanych danych na podstawie wyrażeń regularnych.

Reinforcement-learning is a widely used educational repository that provides implementations, exercises, and solutions for a broad range of reinforcement learning algorithms, designed to complement foundational texts and courses in the field. The project collects popular approaches such as dynamic programming, Monte Carlo methods, temporal difference learning, Q-learning, SARSA, deep Q-networks, and policy gradient techniques, often demonstrated with Python and OpenAI Gym environments so users can experiment with agents learning in simulated tasks. For each algorithm category, the repository pairs conceptual descriptions with runnable code and often illustrated exercises that help solidify understanding by bridging theory with practice. It’s structured to serve learners progressing from basic tabular methods to function approximation and deep learning extensions, making it suitable for students, researchers, or practitioners exploring reinforcement learning fundamentals.

RAS is the acronym for Result Assessment System. The primary purpose of RAS is helping users manage, visualize, assess and report results obtained from experimental search algorithms.

Java objects that share parts of immutable graphs. Reused subgraphs have directly or indirectly recursive Elements. Selected components get replaced by new counterparts in Context of Mirrors - translation tables. Deep copies are not involved.

Extended randomization program. Support many custom randomization types and algorythms.

An academic project where computer-science students can practice data structures principles. Based on the famous problem of the labyrinth rat, this application has an engine where you can run your own algorithms to help the robot to get out of the laby.

Robot Warfare is a real-time strategy game that gives the user an opportunity to manage and program a team of battling robots that autonomously face opposing teams in a network-enabled environment.

Robotypo is a Web app which hosts battles between robots - simple Java programs. This project is the Eclipse project archive of RobotypoCreator, which is for creating robots on Robotypo: http://robotypo.appspot.com

RobGP is a genetic programming system written from the ground up in C++. It's primary goals are efficiency, ease of use, and extensibility. It's distinguishing feature is that it has a modified version of Koza's architecture altering operations.

Ropes are a scalable string implementation that are designed for efficient operation by utilizing lazy operations such as concatenation and slicing. This is a python C module which implements ropes for pythons.

Depending on a SICK lasescan and a created environment landscape a routing function will be implemented to give a robot a few waypoint to drive from a start point to a choosen destination.

RunAsApproximator es un programa java multilenguaje que implementa algoritmos numéricos. Los datos de entrada son aquellos requeridos por cada algoritmo y los de salida son resultado final y los datos intermedios necesarios para alcanzar su resolución.

Rupantor- Bijoy to Unicode converter. It converts Bengali texts written in Bijoy fonts to UNICODE. রূপান্তর- বিজয় থেকে ইউনিকোড এ পরিবর্তন করার সফটওয়ার। এটি à