sandlib | GA | |
---|---|---|
- | - | |
- | 19 | |
- | - | |
- | 0.0 | |
- | over 12 years ago | |
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.
sandlib
We haven't tracked posts mentioning sandlib yet.
Tracking mentions began in Dec 2020.
GA
We haven't tracked posts mentioning GA yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
tensor-safe - A Haskell framework to define valid deep learning models and export them to other frameworks like TensorFlow JS or Keras.
hopfield - hopfield
best_AI_papers_2021 - A curated list of the latest breakthroughs in AI (in 2021) by release date with a clear video explanation, link to a more in-depth article, and code.
genprog - Genetic programming library
GoAIRatings - Estimate Go AI ratings by real games
hnn - haskell neural network library
heukarya - genetic programming in haskell
grenade - Deep Learning in Haskell
smarties - haskell behavior tree 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.