Search Results for "genetic algorithm software"

Conversation as a platform (CaaP) is the future, so it's perfect that we're already offering the whole toolkits to our .NET developers using the BotSharp AI BOT Platform Builder to build a CaaP. It opens up as much learning power as possible for your own robots and precisely control every step of the AI processing pipeline. BotSharp is an open source machine learning framework for AI Bot platform builder. This project involves natural language understanding, computer vision and audio...

xiaohongshu-ops-skill is a curated repository focused on operational strategies, growth techniques, and content optimization practices for the Xiaohongshu platform, also known as RED, which is widely used for social commerce and influencer marketing. Unlike traditional software projects, it functions as a structured knowledge base that compiles actionable insights for content creators, marketers, and businesses aiming to grow their presence on the platform. The repository includes guides on algorithm behavior, content positioning, audience targeting, and engagement strategies tailored to Xiaohongshu’s ecosystem. ...

nunn is a collection of ML algorithms and related examples written in modern C++17.

An easy-to-implement library that can assist Java developers in using the GeoHash algorithm in order to create geocodes based on custom latitude and longitude values. With the help of jGeohash, software developers will be able to quickly and easily generate a geohash code using user-defined latitude and longitude values. By using the GeoHash algorithm, the space can be divided into multiple grid shapes. This library is a basic implementation from the GeoHash algorithm written in the java can be applied to generate from the latitude and longitude a geohash code and reverse. ...

The MaxParser is written in c++ and can parse with first, second, third and fourth order projective Graph-based Dependency parsing algorithm. The project is the new version of the project "Max-MSTParser". If you want to use this software for research, please reference this web address in your papers

Critterding is a "Petri dish" universe in 3D that demonstrates evolving artificial life. Critters start out with completely random brains and bodies, but will automatically start evolving into something with much better survival skills.

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.

...It's all very randomly generated, and there is no way for any user input. I'll consider putting some in later. I had been wanting to make the Game of Life for some time as well as make some kind of genetic algorithm based code. So, here is what I came up with. While this may just seem like simplify a graphical display of what boredom looks like... well, it really doesn't go much past that point. If you Don't know what Conway's game of life is: It's the Black (Or white, I may have changed them) cells that follow a simple set of instructions based on the state of its adjacent cells. ...

The Mars Rover Simulator project is based on the evolutionary robotics paradigm where an artificial agent acquires its skills through the process of artificial evolution. This simulator can be useful to evolve neural network controllers for the rover

breve is a free, open-source 3D multi-agent simulation package designed for simulating decentralized systems and artificial life.

POGA - Parameter's Optimization by Genetic Algorithm - Developed by Leonardo Santos (LAC-INPE :: santoslbl@gmail.com) and José Miranda (IF-UFBA :: vivas@ufba.br). 114 Downloads of the first version. Second version avaliable.

This is implementation of parallel genetic algorithm with "ring" insular topology. Algorithm provides a dynamic choice of genetic operators in the evolution of. The library supports the 26 genetic operators. This is cross-platform GA written in С++.

This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.

Springbots is a python application which takes a set of 2d physical structures built with nodes and movable springs and evolve them for specific tasks like walking, swimming and jumping using genetic algorithm.

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.

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!

This project intends to create an indexing search engine, for knowledge management. The primary object is to apply an information retrieval core. And implement a knowledge data discovery theory such as data mining algorithm, text mining.

Formicidae is the official simulator and visualizer for the Ant-Wars competitive programming site, written in Java and SISC. The site is hosted at www.ant-wars.net.

Academic project aiming to write an alife Avida-like program in java.

This is a cross-platform framework for using Genetic Algorithms for solutions. Written in Java and uses convinient plug-in features for every phase in the genetic development, while maintaining an easy-to-use API for easy integration into applications.

Integer Singular Value Decomposition Genetic Algorithm Function Fitter. This is an optimization algorithm that performs a similar role to a neural network.

GAZES - Genetic Algorithm Zombie Eradication Simulation Grid-based simulator for zombie scenario. The units will use genetic algorithm to determine their actions on a cycle by cycle basis. This is a school project, so is likely on hiatus for summer.

The "Knight's Tour" is a puzzle the object is to move a knight, to every other square, landing on each square only once. This is usually considered to be a challenging puzzle. I will use a heuristic (hyu̇-ˈris-tik) approach to solve the problem.

a sandbox for trying my engine ideas