One platform to build, fine-tune, and deploy ML models. No MLOps team required.
Access Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
Try Free
Earn up to 16% annual interest with Nexo.
Let your crypto work for you
Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform.
Geographic restrictions, eligibility, and terms apply.
Galileo is a library for developing custom distributed genetic algorithms developed in Python. It provides a robust set of objects that can be used directly or as the basis of derived objects. Its modularity makes it easy to extend the functionality. The
The Athlete is a virtual robot living in the ODE (Open Dynamics Engine)world. An evolution algorithm is implemented based on the DR-EA-M to optimize its performances. This involves a Geneticalgorithm, network of neurons and morphology. All is in java.
Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
Sigel teaches virtual robots to walk in a physical 3D-simulation.
It uses the method of "Genetic Programming" to evolve control
programs for any robots that come into your mind, visualizes them using OpenGL
and exports animations to Povray.
This program is based on a algorithm that solves a Master Mind combination.
The algo seems to work but without hole and with 5 different colors in an atempt.
Simulated annealing package written in Java using simplex downhill algorithm from Numerical Recipies in C++/FORTRAN/C
It is intended for use "behind the scenes" in applications, and it is optimised for ease of integration.
Completely standalone,
This library defines classes for using genetic algorithms to do optimization in any C++ program using any representation and genetic operators. The distribution includes extensive documentation and many examples.
I needed a library of functions that enabled me to perform hash
functions and symmetric cryptography. I chose MD5 initially but
eventually chose SHA as the hashing algorithm due to concerns regarding
the \'collision resistance\' of MD5 due to weakne
MAGMA: Multiobjective Analyzer for Genetic Marker Acquisition
A geneticalgorithm for generating SNP tiling paths from a large SNP database
based on the competing objectives of cost (number of SNPs) and coverage (haplotype blocks):
Hubley R., Zitzler
GD is AI - ALife becoming true. It's a genetic engine server, capable to run any kind of geneticalgorithm. It has TCP architetcure, working with software clients and uman interaction. It has plugin capabilities and comes with a working Function Finder
Two Dimensional NOesy simulation (TDN) implementents an algorithm that creates a time-domain 2D NOesy spectrum. TDN does not calculated the nOe peak intensities, Therefore, you will need the CORMA (Complete nuclear Overhauser Relaxation Matrices).
PPAT, or Parallel Path following Algorithm using Triangles, is a reliable parallel tool to trace the level curves of any continuous, not necessarily smooth, function f(z): C → R.
SysK allows to crypt text by using system informations calculate the algorithm.
For each user,the crypt algo will be different.
It's written in C language for Linux x86.
The objective is to allows it to crypt streams, binaries and more.
GNU FriBidi is the Free Implementation of the Unicode Bidirectional Algorithm. GNU FriBidi development has been moved to GitHub. See https://github.com/fribidi/fribidi/
Java port and extension of MLC++ 2.0 by Kohavi et al. Currently contains ID3, C4.5, Naive (aka Simple) Bayes, and FSS and CHC (geneticalgorithm) wrappers for feature selection. WEKA 3 interfaces are in development.
PMDGP is an object oriented framework written in C++ for implementing genetic programming problems. Once a GP problem has been implemented using the framework, a GUI client and Server can be used do distribute the fitness evaluation.
This is an academic project.
A library and a sample program will be developed, that will implement the Burrows-Wheeler compression algorithm, using C++ and templates.
This is the same algorithm for BZip.
Patch to Linux kernel, which makes the virtual memory system use working set page replacement algorithm. It will also allow restriction of how much RAM a process can use and also a guarantee of a minumum of RAM that will never get swapped out.
Algorithm that can generate any given series of probabilities G, using only fair coins.
The algorithm creates a Huffman tree by decomposing any probability P into a sum of probabilites Q, where each Q is a power of 1/2.
Than using the coins, the tra
CRefDynGenStrArray is a fast and space efficient STL-vector(char)-based dynamic array of generic strings. Supports storing and retrieval of Pascal&C style strings, STL strings and vector(char). Provides STL algorithm adapter class.