Open Source Windows Algorithms - Page 28

The algorithm used by this MasterMind applet is very simple. Yet it is also very fast and it uses relatively few guesses.

Math4J is a java library with an object-oriented design of some mathematical ideas: functions, primality, complex numbers, etc. It also consists of some utility methods and classes for mathematical constructions.

mathCollection is a java package representing a consistent and efficient extension to the Java Collection Framework of JDK 1.4. It offers different kinds of sets with mathematical, non-destructive functions.

Allow make operations with date un java

Math tools in Python to tackle down problems in Operational Research fields. Comes with a Django based web interface to allow remote access to complex simulation means.

FREE Download Open Source Code Simple Test of Microsoft .NET C# using MATLAB NE Builder Toolbox This is a simple demo of this powerful Matlab toolbox with some M script algo examples Download the ZIP package from http://quantlabs.net/blog/2012/11/free-download-open-source-code-simple-test-of-microsoft-net-c-using-matlab-ne-builder-toolbox-matlab-csharp/

Video and files download for Visual trading idea to C++ or FPGA HFT Meetup File download sample: test model (Matlab 2014b with Visual Studio 2013 C++ project generated) Powerpoint MATLAB SIMULINK http://quantlabs.net/blog/2015/04/video-and-files-download-for-visual-trading-idea-to-c-or-fpga-hft-meetup/

MatixTurn is an AS3 Library used for Flash games optimizations. The technique is to transform each vector graphic animation, into cached matrices, for a better computer calculation and a very fast real time rendering. Keep your files low in datasize without manually transform each of your your movie clip in bitmap. All process is done on real time processing with integrated progress bar per-loading system.

Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added.

A Map (or HashTable) for Java that is backed by the filesystem to provide unbounded size. Additionally, MegaMaps may remain on disk between VM invocations, providing persistent hashtables.

The MemSL for C and C++ includes a complete data structures/collection classes library, memory tracing, memory debugging, logging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.

Easy To Use Collection Classes For C And C++ The Memory Structures Library (MemSL) has implementations of structures (i.e. AVL trees, threaded trees, dynamic hashing, ...) that are extremely hard to find and far harder to implement.

MAIF is developed in Java 5 (especially Generics) and aims at building AI algorithms, by concentrating onto the mapping of real-world problems, while abstracting from their inner working. It can be extended with new algorithms and problem representations.

MicroGP (µGP, ugp) is a versatile optimizer able to outperform both human experts and conventional heuristics in finding the optimal solution of hard problems. It is an evolutionary algorithm since it mimics some principles of the Neo-Darwinian paradigm. ⚠️ A new version is available on https://github.com/squillero/microgp4

The library for utilization of Minimal Quadtree format for storing very large sparse matrices. Please see the paper referenced below for the description of a problem. Corresponding papers: Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices (I. Šimeček, D. Langr, P. Tvrdík), In Scalable Computing: Practice and Experience, volume 15, 2014. Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures (I. Šimeček, Daniel Langr, Pavel Tvrdík), In Proceedings of 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2013), 2013. Minimal Quadtree Format for Compression of Sparse Matrices Storage (I. Šimeček, D. Langr, P. Tvrdik), In 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'2012), 2012.

Mitandao is a multiplatform free and open source social network analyzer written in Java. It can be used as a stand-alone application as well as a library in your projects.

MobileMath is a software written by using J2ME technolology. It turns mobile into calculator supporting many operations such as : evaluate expression, plotting, differentiate & integrate expression... It can run on any mobiles supporting Java.

A Pascal unit providing functions to format Brazilian Real (R$) currency.

Mouse Run is a programming game where programmers can implement a mouse and let it run in a maze to hunt of cheese. It is a battle among programmers to test who can build the most intelligent mouse, given limited information during the game. Programmers need only implement one code file, extending from an abstract class that will contain the logic of the individual mouse. The game Host will gather all the mouse implementation and let them run in the maze. It is real fun for geeks/nerds/(or whatever you like to call yourself) like us. This game will be a perfect practice tool for programmers like us to find the best algorithm solutions and make the mouse intelligent. To get information on this game, visit the Mouse Run website at http://mouse-run.appspot.com If you have found bugs or have a request, please do write it in the reviews. Thanks!

To give users the full control over the running application. This means that an application is working according to its purpose but the control over the whole interface is taken from developer and given to users. While an application is running, users can move, resize, and tune all the screen objects through which the communication with an application is going. Set of files includes the book (both in DOC and PDF formats), a big demonstration project with all its files available (all the source files are in C#), and an additional description of many used classes. Book uses the examples from the demo project to explain everything in details. The examples are from many different areas. Examples from the first part of the book are aimed at the details of algorithm and its use with different objects; examples from the second part are mostly the real and very useful applications.

Mr. Logister is a resource scheduling application that uses genetic algorithms to find the best utilization and allocation of resources. The scheduler understands hard constraints like free/busy time and soft constraints like suitability and preferences.

Non backtacking NFA implementation of regular expressions for dot net.

This is a recursive C++ source code of the Fast Fourier Transform algorithm allowing parallelization. Also a performance test and its results on my computer are provided. The Performance test suggest to use 4 threads for parallelization. With this one can beat the implementation in "Numerical Recipes in C++" for large signals with more than 2^16 / 2^17 / 2^18 samples depending on the hardware and software.

A Java framework to create multi-threaded dispatching applications. It is a framework that realizes an application pattern that often appears while creating business applications.

A simulation environment for 2D robots to interact and perform tasks in. Meant to be educational and demonstrate emergent behaviors. No download necessary! See demos on project website!