Open Source Windows Algorithms - Page 10

The Airs GPT project experiments with Steady State Genetic Programming create agents that play tag. It emphasises co-evolution through competition, and provides the user with some tools to help them visualize what is taking place.

Project description and support moved to : https://github.com/Zeus64/alcinoe However you can use the source you prefer, the SVN here or the GIT on github, both are synchronized (just that GIT don't support large file > 100 mo so some minor files used only as references are missing from GIT)

Alef++, is a new programming language like Perl and Lisp syntax, with a many changing in classical languages designs, her specification designed to be implemented for any VM, by default can access to any private/protected/default Java fields or methods.

Aleph is both a multi-platform machine learning framework aimed at simplicity and performance, and a library of selected state-of-the-art algorithms.

AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over matrices, etc. - please see at the site. Almost all classes and methods are thoroughly documented via JavaDoc (you may read full JavaDoc at the site).

--> Now available in English! Click "Browse All Files" to get it. <--- AlgDomes is a free, open source, educational application, designed to visually project and explain known algorithms in data structures. Designed & Created by: Konstantinos Kourmousis and Pavlos Paschalidis. ====================================== Η εφαρμογή AlgDomes είναι μια δωρεάν, ανοιχτού κώδικα εκπαιδευτική εφαρμογή οπτικοποίησης και επεξήγησης γνωστών αλγορίθμων σε δομές δεδομένων. Δημιουργήθηκε από τους Κουρμούση Κωνσταντίνο και Πασχαλίδη Παύλο, υπό την εποπτεία του Τομέα Υπολογιστικών Τεχνικών και Συστημάτων του Τμήματος Πληροφορικής του Τ.Ε.Ι. Σερρών, στα πλαίσια της πτυχιακής τους εργασίας.

An Algorithm Library written in .Net 2.0 which includes common algorithms.

The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.

Algorithms in Python is a collection of algorithm and data structure implementations (primarily in Python) meant to serve as both learning material and reference code for engineers. It includes code for graph algorithms, heap data structures, stacks, queues, and more — each implemented cleanly so learners can trace logic and adapt for their problems. The repository is particularly useful for people preparing for competitive programming, job interviews, or building a foundational understanding of algorithmic patterns. Because it’s openly maintained, you can browse through issues, see test cases, and observe coding style in a “learning through code” fashion. It also serves as a playground where you can add problems, measure performance, and compare different algorithmic approaches. For anyone striving to move from “I know the syntax” to “I know how to use the right algorithm at the right time,” this repository is a practical asset.

Provide implemented algorithms and functions with demo programs to test.keeped portable as possible at OS level and programming language(understanding)level.provide third party archives if available for ralvent algorithm.links for YouTube videos on availability by us and third party.

This will help a new data structure learner to learn data structures quickly.

The Gene Expression Programming Framework in Java. It separates the process of evolution from the process of interpretation of the chromosome, allowing the use of various schemes in the chromosome.

A complete library of high-speed java collection classes to complement existing classes with new and advanced algorithms. Complements standard J2SE classes and Jakarta commons classes

AIS is an Development Platform providing a high-speed JIT compiler for LISP and JavaScript, web server, object repositories, MySQL integration and libraries supporting a wide variety of advanced genetic programming and symbolic regression techniques.

The purpose of the project is summarising effort from a number of analytic libraries, adding interactive web-based user interface and making a free open source solution for risk analytics and stress testing. Feb 8, 2012 Paul Glasserman's Importance Sampling and Tail Approximations as well as plain Monte Carlo have been implemented for for the widely used normal copula model of portfolio credit risk. The package includes source code, examples, spreadsheet with results and references to the papers.

Este proyecto constituye una adaptacion y mejora del codigo ANFIS de dominio público de Roger Jang. / This project is an adaptation and improvement of the original public domain ANFIS code of Roger Jang.

Animants are virtual ants. Their name comes from the combination of "ants" and "animats", an animat being "a sofware approximation of a living creature". Animants aim to simulate the behaviour of living animals.

An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes

Delphi library of standard containers for keeping ordinal and structured datatypes.

The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. PLOS ONE, 8:4 e60954, 2013.

The Arbitrarily-Decomposed MPI FFT library is a C subroutine library for the computation of the multidimensional Fast Fourier Transform (FFT) of a distributed grid using the Message-Passing Interface (MPI).

Dieser Parser, soll arithmetische Ausdrücke, die als String vorliegen, ausrechnen, bzw. diverse Funktionen darauf anwenden können. Bis jetzt kann er nur Audrücke wie "4^(5+2)-23*4/cos(3)" ausrechnen. er unterstützt auch vergleichsoperatoren

Aim is to develop a library of utility functions to efficiently simulate division, multiplication, mod, finding first 1/0 bit etc. (using shift and add/subtract) for software development on low cost dsp systems lacking these.

High-performance computing code and libraries used in the High Performance Computing subject in Telecommunications Engineering at the University of Granada (http://geneura.ugr.es/~jmerelo/asignaturas/AAP)