Search Results for "beta" - Page 5

A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.

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

* EpLibrary project in this site is not maintained anymore. * The project has been moved to https://github.com/juhgiyo/EpLibrary EpLibrary is a utility library for Visual C++. The features includes: - Math Framework - Enhanced Binary Search - Sort - Stream Framework - Container Framework - Simple Debugger Framework - FileSystem Framework - Other Frameworks - Server/Client Template Framework - System Framework - Thread System For detailed documentation,...

This API is intended to help developers use genetic algorithms in their own java applications. GeneticLibrary.zip contains the netbeans project of the API itself. GeneticTrial.zip contains another netbeans project which is an example explaining how to use the API. docs.zip is the documentation of the API. Please take a look there, it is really helpful. I have only two request from who will use this API; USE, UPDATE AND MODIFY IT FREELY JUST NOTE THE ORIGINAL AUTHOR

NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.

HOOPLE is a portable collection of C++ source code, featuring thread-safe objects for collections and event processing, RPC-style plugin-based encrypted networking (CROMP / octopus), bookmark collection management utilities, and a lot of other cool stuff. This is the project page for HOOPLE version 1, which was retired on September 25 2010. The code supposedly still builds on both Linux (with gnu gcc) and on Windows (with ms visual studio). Most of the code from hoople1 has moved into...

Syntactic is a simple C++ library for constructing general Neural networks. For now the library supports creation of multi layered networks for the Feedforward Backpropagation algorithm as well as Time Series Networks. More will be implemented soon.

Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator

A simple utility which creates a printable string of data usage. E.g. supply the value 1234567890 and DataUsagePrinter will return the string "1GB 153MB 384KB 722B". Available as binary and source downloads for Java and C#.

CRCLIB is a small library of CRC calculations which can be used in other programs. Because CRC check is often used by binary communication protocols, it is made as simple as it can be, built into library so that it could be used regardless of language of application code. Written in plain C, built as dll and static library, and also contains C/C++ import header, C# wrapper and .NET project for MS SQL Server assembly. Supports CRC16 (including MODBUS) and CRC32.

Provides bitwise, context-based 2nd generation data compression for large FASTQ-based files

SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.

In this Project,you can find a Phone book is implemented in an AVL Tree, you add new contacts, delete, and save the list to a text file Please check the project files here: https://sourceforge.net/projects/phonebookavl/files/

WordSort is an algoritm written in c# specifically designed for string sorting with linear complexity. Based on partial hashing approach, provides higher performance than classical algorithms that use the comparison. WordSort includes a console application easy and intuitive to use to evaluate and compare algorithms performance. Only Ordinal sorting and non-case-sensitive sorting provided.

The class 'JSEvaluator' in this project allows us to interpret expressions in JScript, allowing us to use parameters in the server at runtime. For example: ({@ 1} + {@ 2}) / 100; Parameter {@ 1} : 36 Parameter {@ 2}: 45 Result of the expression: 0.81

This project is primarily for testing and demonstrating ideas for an ultimate programming system, though it might very well become a very usable programming system in time. It is being developed with PowerBasic's PBWin7 compiler.

Coupling the notion that during the search for the minimum of a function we must pass through its solution with a PSO solution generator engine, is the approach for solving, in time domain, a non-linear algebric-differential system of equations.

General purpose library (and some tools) that allows the construction of recursive deterministic/non-deterministic automaton from non-deterministic settings.

With this application you will know, instantly the time difference between two dates in the form of date, days, hours, minutes, and seconds!

Fractal/Scripting VSTi synthesizer, written on Java with jVSTwrapper

"UltraQueue" is a library (DLL) project, written in C++. This library is intended to be used for very fast temporary data storage, aquired by any possible source (File, Serial Port, ...). Users can create multiple queues of differrent sizes & types

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

A self-contained, fully configurable Java "game" to simulate multi-species evolution. Design species by optionally specifying every attribute; modify any or all environmental settings; let them loose to eat, fight, procreate, die, and Evolve!

Parser Delphi class. Extendable parser that processes numbers (int/hex/float), text constants in quotation marks (with '' \' \n, \t, \u0000, etc), brackets, lists (comma separated elements), skips whitespaces and comments like //, /* */

A generic implementation of STL containers and some STL algorithms. The main intent is no make this STL implementation to work with any kind of pointers defined by allocator classes, e.g. memory_mgr::offset_ptr.