Open Source Windows Algorithms - Page 43

Zero Sum Game Solver JavaScript Library

Zipline is a Pythonic algorithmic trading library. It is an event-driven system for backtesting. Zipline is currently used in production as the backtesting and live-trading engine powering Quantopian -- a free, community-centered, hosted platform for building and executing trading strategies. Quantopian also offers a fully managed service for professionals that includes Zipline, Alphalens, Pyfolio, FactSet data, and more. Installing Zipline is slightly more involved than the average Python package. For a development installation (used to develop Zipline itself), create and activate a virtualenv, then run the etc/dev-install script. Please note that Zipline is not a community-led project. Zipline is maintained by the Quantopian engineering team, and we are quite small and often busy.

The C++-programs simulate : Nondeterministic/Deterministic Multitape Turing & Post Machines, Universal Turing Machine, Turing Machine with faults, failures and recovery.

aigochess is a chess-style board game and uses improved faile engine with strong AI.The feature of this game is adding two Cannon which comes from Chinese Chess into original chess. It's the official traning software for China aigo Chess Club.

Learn how to programm in c++ This project includes example Programms of Algorithm and Datastructure. Three students of Htwg Konstanz will release regularly example Programms in order that other people can learn c++. The first sources will be about search

Moved to GitHub https://github.com/fedups Algebraic equation processing at run time for Java programs. Supports variables, functions with parameters, rate table lookups, an embedded "if" function... Infinitely extensible, very small footprint.

Traditional Computer Science algorithms and data structures implemented in JavaScript. Algorithms such as collatzConjecture, extendedEuclidean, fastPower, fibonacci, findDivisors, fisherYates, gcd (Greatest common divisor), greatestDifference, lcm (Least common multiple), newtonSqrt, nextPermutation, powerSet, reservoirSampling, shannonEntropy, etc.

aptimelib is a new, extremely portable, generic, 64-bit, time/date library. It implements the proposal by David R. Tribble ( http://david.tribble.com/text/c0xlongtime.html ), featuring epoch basis, microsecond granularity, and platform translation.

Can emulate old computer on text the code pogram ideal to create kernel for operating system The begin the project the can emulate CPU(8080)and z80.

Ponteiros para array no pascal

This is an avl tree implementation. It is implemented in very optimized way and easy to use. It does not force you to use any specific way of memory allocation. It does not use recursive call. It is implemented with emphasis on speed and simplicity.

A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com). Given a log-file, this tool will replay a T4C game you've played before. It will have built-in functionnalities like : merging log files together, searching and cleaning

Bitswarm is a computational-oriented project: it provides a library of n-dimensional bit-array manipulation primitives. Unix and win32 platforms are supported.

brCluster is a class library, written in java, that implements generic clustering algorithms carefully designed to allow its aplication in any kind of data. The algorithms implemented are K-means and Hierarchical Clustering (Simple and Complete Link).

BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN).

Expresses C program in graphical control flow chart in VCG GDL.

A light-weight Regular Expression (regex) C library, using double-recursion. (command prompt tester included)

Cachelet is a java framework for general purpose caching very simple and easy to use. And it has everything you need for caching without complications.

Written in C++ (using template). Calculator++ is a application/library for Window (POSIX). The core of code is adaptable for posix. This algorithm support: + built-in operator + built-in functions + run-time functions and variables definition + run-time units system, units with prefix + constants definition + Pretty mathematical expressions - Process ascii files (dev) - vector and matrix (dev) - graph 2D and 3D (dev) - vector graph (dev) - symbolic calculate (dev) - Animations (dev)

callgraph is a project that provides an algorithm for an optimal vertex positioning of any connected graph in 3D, as well as the library and sample application for viewing graphs in 3D.

The 'cbear' framework is a set of libraries and common utilities for different programming languages and platforms.

Public description: The 'cbear' framework is a set of libraries and common utilities for different programming languages and platforms.

CDS (Concurrent Data Structures) is a C++ template library of lock-free and fine-grained lock-based algorithms. It contains a collection of concurrent data structures: queues, stacks, sets, maps, etc, and safe memory reclamation schema for concurrent containers - Hazard Pointer and user-space RCU. See doxygen doc http://libcds.sourceforge.net/doc/cds-api/index.html. The source code repo for libcds 2.x has been moved to https://github.com/khizmax/libcds

Backwards mappable double linked list for Common Lisp.