Simple-genetic-algorithm-mr Alternatives

Similar projects and alternatives to simple-genetic-algorithm-mr

• hnn

  0 112 0.0 Haskell simple-genetic-algorithm-mr VS hnn

  haskell neural network library

• simple-genetic-algorithm

  0 12 0.0 Haskell simple-genetic-algorithm-mr VS simple-genetic-algorithm

  Simple parallel genetic algorithm implementation in pure Haskell

• WorkOS

  workos.com

  sponsored

  The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

  

• simple-neural-networks

  0 12 0.0 Haskell simple-genetic-algorithm-mr VS simple-neural-networks

  Simple parallel neural networks implementation in pure Haskell

• Etage

  0 0 0.0 Haskell simple-genetic-algorithm-mr VS Etage

  A general data-flow framework featuring nondeterminism, laziness and neurological pseudo-terminology.

• liblinear-enumerator

  0 3 0.0 C++ simple-genetic-algorithm-mr VS liblinear-enumerator

  Haskell bindings to liblinear

• tensor-safe

  0 101 0.0 Haskell simple-genetic-algorithm-mr VS tensor-safe

  A Haskell framework to define valid deep learning models and export them to other frameworks like TensorFlow JS or Keras.

• neet

  0 12 0.0 Haskell simple-genetic-algorithm-mr VS neet

  Neuroevolution of Augmented Topologies (NEAT) -- in Haskell

• InfluxDB

  www.influxdata.com

  sponsored

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

• smarties

  0 11 0.0 Haskell simple-genetic-algorithm-mr VS smarties

  haskell behavior tree library

• moo

  0 61 0.0 Haskell simple-genetic-algorithm-mr VS 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 initializatio

• csp

  0 15 0.0 Haskell simple-genetic-algorithm-mr VS csp

  Constraint satisfaction problem (CSP) solvers for Haskell