Build gen AI apps with an all-in-one modern database: MongoDB Atlas
MongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
Start Free
Our Free Plans just got better! | Auth0
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics
Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function.
Point Symmetry Clustering Approach Using Differential Evolution
Implementation of Point Symmetry-based Automatic Clustering
Approach Using Differential Evolution
Using bug fixed KD tree nearest neighbor search from https://github.com/CristianDallos/kmeansclustering. (It is also modified to search for multiple nearest points instead only for one.)
Used those academic works for algorithm implementation:
http://cs.cug.edu.cn/teacherweb/gwy/Publication/ISICA-09.pdf
http://www.isical.ac.in/~sanghami/ieeetkde_cameraready.pdf
http://www.softcomputing.net/smca-paper1.pdf
1. You may download code:
git clone git://git.code.sf.net/p/pointsymmetryclustering/code pointsymmetryclustering-code
2. Build:
mvn clean install assembly:assembly -DskipTests -Dmaven.test.skip=true -DdownloadSources=true -Dcheckstyle.skip=true
3. ...
Bin Packing problem solved using Genectic Algorithm
This project contains a solution for a Bin Packing problem solved using Genectic Algorithms.
The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007.
unEvo is an Eclipse plug-in that provides support for the experimentation and research process on Evolutionary Algorithms, intended so that the user can implement an evolutionary algorithm without lost time in the code of the algorithm.
Full access to Enterprise features. No credit card required.
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.