CarneadesDSL
simple-genetic-algorithm
| CarneadesDSL | simple-genetic-algorithm | |
|---|---|---|
| - | - | |
| 2 | 12 | |
| - | - | |
| 0.0 | 0.0 | |
| almost 11 years ago | over 7 years ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
CarneadesDSL
We haven't tracked posts mentioning CarneadesDSL yet.
Tracking mentions began in Dec 2020.
simple-genetic-algorithm
We haven't tracked posts mentioning simple-genetic-algorithm yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
svm-simple - Simplified interface to bindings-svm
simple-genetic-algorithm-mr - Fork of simple-genetic-algorithm using MonadRandom
cv-combinators - Functional Combinators for Computer Vision, currently using OpenCV as a backend
hnn - haskell neural network library
moo - Genetic algorithm library for Haskell. Binary and continuous (real-coded) GAs. Binary GAs: binary and Gray encoding; point mutation; one-point, two-point, and uniform crossover. Continuous GAs: Gaussian mutation; BLX-α, UNDX, and SBX crossover. Selection operators: roulette, tournament, and stochastic universal sampling (SUS); with optional niching, ranking, and scaling. Replacement strategies: generational with elitism and steady state. Constrained optimization: random constrained initialization, death penalty, constrained selection without a penalty function. Multi-objective optimization: NSGA-II and constrained NSGA-II.
csp - Constraint satisfaction problem (CSP) solvers for Haskell