funsat VS cmaes

Compare funsat vs cmaes and see what are their differences.

funsat

An efficient, embeddable DPLL SAT solver in Haskell (by dbueno)

cmaes

A Rust implementation of the CMA-ES optimization algorithm. (by pengowen123)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
funsat cmaes
0 3
35 30
- -
0.0 0.0
over 8 years ago almost 2 years ago
Groff Rust
BSD 3-clause "New" or "Revised" License Apache License 2.0
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.

funsat

Posts with mentions or reviews of funsat. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning funsat yet.
Tracking mentions began in Dec 2020.

cmaes

Posts with mentions or reviews of cmaes. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning cmaes yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing funsat and cmaes you can also consider the following projects:

incremental-sat-solver - Simple, Incremental SAT Solving as a Haskell Library

graph-generators - A Haskell library for creating random Data.Graph instances using several pop

Ritt-Wu

twentyseven - Rubik's cube solver in Haskell

binary-search - Binary and exponential searches

build - Build Systems à la Carte

spacefill - Space-filling curves

presburger - Decision procedures for Presburger arithmetic in Haskell

lca - Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing

arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences

ADPfusionSet - dynamic programming for set data structures

ADPfusion - Efficient, high-level dynamic programming