Open Source C# Algorithms - Page 5

A library that does preform precise floating point operations designed for industrial / banking solutions.

Provisio.Collections brings STL like iterator-based containers to the .Net world (especially C#). It offers fundamental sequential (vector/list/deque) and associative (tree/skiplist) containers that can be filled, traversed and modified using iterators.

An attempt to discover new kinds of Fractals by generalizing Pythagoras's Theorem into higher dimensions and negative numbers. Pythagoras Theorem when a < 0.0 and b >= 0.0 : c^2 = a^2 + b^2 * (((a*a + b*b)^0.5 - b)^2.0/(b - (a*a + b*b)^0.5)^2.0) c^2 = a^2 + b^2 * (((a*a + b*b)^0.5 - b)^2.0/(b - (a*a + b*b)^0.5)^2.0) * 1.0 c^2 = a^2 + b^2 * (((a*a + b*b)^0.5 - b)^2.0/(b - (a*a + b*b)^0.5)^2.0) * (-1.0 / -1.0) c^2 = a^2 + b^2 * (((((a*a + b*b)^0.5)*i - b*i)^2.0)/(b*i - (((a*a + b*b)^0.5)^2.0)*i)) Pythagoras's Theorem with negative numbers : For a < 0 and b >= 0 : c^2 = a^2 + b^2 * (((((a*a + b*b)^0.5)*i - b*i)^2.0)/(b*i - (((a*a + b*b)^0.5)^2.0)*i)) for a >= 0 and b < 0 : c^2 = b^2 + a^2 * (((((a*a + b*b)^0.5)*i - a*i)^2.0)/(a*i - (((a*a + b*b)^0.5)^2.0)*i)) for a < 0 and b < 0 : c^2 = a^2 + b^2 for a >= 0 and b >= 0 : c^2 = a^2 + b^2 There is Pythagoras's Theorem on Complex Plane numbers.

Turing Machine Simulator using Quintuples (5-tuples). Intended for primarily for Computer Science education.

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.

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

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

SVM# is a svm(support vector machine) classification implemented in C#. The project contains both train and predict modules.

ScienceNET is a open source library written in C# which aims to provide a self contained clean .NET framework for neural networks, genetic algorithms, optimization, image processing and for other domains of a computational science.

This project an efficient method of solving a scrabble board.

The SiGeR library allows developers to quickly code powerful custom gesture recognizers for Tablet PC development.

Sissor is a program that evolves programs. Sissor is an acronym for Scriptable Interactively-Steered Self-Organizing Routines.

SourceAFIS is a software library for human fingerprint recognition. It can compare two fingerprints 1:1 or search a large database for matching fingerprint. It takes raw fingerprint images on input and produces matching score on output. Click the website link above for more info.

A library for expanding shell variables and embedded processing instructions. Initially in C#/.NET, with ports to other languages planned

A "programming language" that can generate random strings. Useful for creating password, but has many other uses (it can generate IP addresses, fully random but pronounceable words, ..., anything that a string can represent). Written in C#

A light weight Desktop Search Application built in .net C# and Vb.net implemented using file search recursive algorithm and threads. provides explorer like view of files. It can be implemented in mono(platform independent).currently only runs on Microsoft Platform.

My algorithm which solves The Salesman Problem with neighborhoods written in C# with visualisation.

Takthons provides container and manipulation services for evolved machine language routines. This allows the calling application to concentrate on the UI, the fitness evaluation and the genetic operations rather than the machine language details.

AleSimpleLexer is a C# class that tokenizes given text. Can process lists, numbers, text constants, parentheses and comments. Supports unicode.

TextDiff.NET is the .NET component to list differences between two integer arrays using a "longest common subsequence" algorithm. Typically, this component is used to diff 2 text files once their individuals lines have been hashed.

Classic game solved with MinMax algorithm (full solution tree) and simple Heuristics. Specially for learning and teaching computer AI

Discrete Mathematics task solutioner. (The Theory For Scheduling / Network Graphs) Contains C++ mathematic algorithms and C# GUI.

The typing game Typocalypse (https://code.google.com/p/typocalypse/source/browse/#hg/Trie) used a trie data structure which has been linked to separately from the game and has been of separate interest for some years now. It has now been given its own repository. A trie is a data structure used to find strings from their prefixes. After having stored strings in the trie, the trie will efficiently find all the strings which start with a particular prefix. Project was developed using C# on MonoDevelop.

This utility is designed for comfortable and rich control over Turing-McCabe-patterns. It offers realtime exploration using several input parameters, storing and restoring settings, recording videos and taking snapshots of steps as well as rendering patterns in HD.