Displaying 1 to 20 from 35 results

OptaPlanner solves planning problems. This lightweight, embeddable planning engine implements powerful and scalable algorithms to optimize business resource scheduling and planning. This module is just the multiproject parent. The planning engine itself is in optaplanner-core.

optimization scheduling solver constraint-satisfaction-problem constraints vehicle-routing-problem constraint-programming traveling-salesman simulated-annealing constraint-solver hacktoberfest tabu-search branch-and-bound metaheuristics rostering employee-rosteringCuckoo Cycle is the first graph-theoretic proof-of-work, and the most memory bound, yet with instant verification. Unlike Hashcash, Cuckoo Cycle is immune from quantum speedup by Grover's search algorithm. With a 42-line complete specification, Cuckoo Cycle is less than half the size of either SHA256, Blake2b, or SHA3 (Keccak) as used in Bitcoin, Equihash and ethash. Simplicity matters.

cuckoo-cycle bounties proof-of-work graph solverA tiny (~400B) utility that executes a dependency graph of async functions as concurrently as possible.

graph dag dependency concurrently async function solver topologicalNote, that all tests and builds are tested for the following three operating systems: Windows, Ubuntu, Mac OS.

parse latex parsing integration cplusplus calculus algebra jupyter math fsharp computer-algebra nuget solver arbitrary-precision symbolic-manipulation equations differentiation inequality symbolic-mathThis Java project is a rough example of how to develop a brute force validation algorithm to make your computer look like "making guesses". It will take the role of a MasterMind player trying to solve the puzzle set by you.

brute-force master-mind mastermind solverKiwi is a minimalist and extendable Constraint Programming (CP) solver specifically designed for education.The particularities of Kiwi stand in its generic trailing state restoration mechanism, its propagator-based propagation algorithm, and its modulable use of variables and heuristics.

solver architecture optimization satisfiability combinatorial-optimization propagators educationThis module solves sparse symmetric positive definite linear systems, by finding the Cholesky decomposition(the LDL^T decomposition, and not the LL^T decomposition), and then doing forward substitution and backward substitution. It is basically a Javascript port of the paper "Algorithm 8xx: a concise sparse Cholesky factorization package". This kind of solver has many applications in digital geometry processing.Decomposes M into the Cholesky decomposition of the form LDL^T. A function is returned that can be used to solve the equation Mx = b, for some given value of b.

numerical computing sparse matrix solver linear system choleskyBLT is a C/C++ library for solving certain integer linear programming (ILP) problems using techniques that come from the theory of lattices. It is complementary to many existing, traditional ILP solvers in that there are problems it solves very well and very quickly which traditional solvers do not (and vice-versa). For a theoretical discussion, see our conference paper from the 2015 SMT Workshop.

linear-programming decision-procedure lattice-reduction haskell haskell-bindings solver ilp ilp-solver haskell-api yices glpk ntlIt determines whether a given statement in Intuitionistic Propositional Calculus (IPC) is provable or not. Please prepare your consumer key, consumer secret, access token, and access token secret.

ocaml logic solver twitterThis is an experimental library which uses unit tests to autogenerate working code. It works by doing a breadth-first, brute force search over strongly typed abstract syntax trees and returns the first one that satisfies the unit tests.

type types ast abstract-syntax-tree abstract syntax tree induction inductive inductive-programming inductive-functional-programming test testing unit mock solver solve mocks mocking tests programming spec specification tdd test-driven test-driven-development bdd behavior-driven-development behavior-driven behavior ui-testing ui io functional functional-programming fp immutable immutability curry-howard-isomorphism curry howard isomorphism proof proves proofsLogic programming is a declarative style of programming that uses constraints to describe problems. Instead of writing a solution to the problem, you describe the characteristics of the solution and let the computer solve it for you. Different logic programming implementations contain different types of constraints.

kanren logic-programming solver constraintsMachine Learning doesn't have to be complicated. idea.js makes AI's (neural networks, meta heuristic, heuristic, ant colony optimizations, and hives) simple. By telling idea.js what you want to do, it figures out how to do it.

artificial intelligence ai solve solver turkGiven inputs and outputs brute forces a Ramda solution. The solver is very simple and just brute forces the solution by iterating over a bunch of functions. Since Ramda is sooooo good at currying, we can combine multiple functions by providing derived functions as inputs to other functions, like R.map for example, as first arguments. I also use the data to guide the solution tries. For example, R.has(...) tries every string from the input and output as a property name.

bot fp functional ramda solution solverThis is a ROS node integrating the Hand Eye Calibration implemented in CamOdoCal. See this stack exchange question explaining how Hand Eye Calibration works. keynote presentation explaining many details about hand eye calibration for those that are interested. Practical code and instructions to calibrate your robot can be found below.

hand-eye-calibration ros robot-arm rotation orientations kinematics solver translation camera-calibration camera robotics robot dual-quaternion calibration kinect kinect-v2 rgbdThis is a solver for LYNE game. It can also gradually show the connections, which is a helpful way to get a hint without showing the entire solution. The solver is written in JavaScript and HTML+CSS+SVG. It should work on any modern browser, desktop or mobile. It has been tested on Google Chrome 43 and Mozilla Firefox 38.

lyne solver puzzle-solver puzzleLogic puzzles and similar problems can be solved by exploring the space of possible solutions. By enumerating potential answers to open questions like "what should go in this cell?" or "which direction should I go now?", checking whether a given set of those answers is valid, and revising answers whenever you reach an invalid state you'll eventually find the solution (assuming one exists and the problem is finite). This strategy is known as backtracking and has a surprising range of applications. A few simple callbacks are all Backtrex needs to get to work. Backtrex is an Elixir project, and these directions assume you are using the mix tool. However, it should be possible to use this project in Erlang as well.

backtracking elixir solver brute-forceJulia wrapper to CSDP semidefinite programming solver. The original algorithm is described by B. Borchers. CSDP, A C Library for Semidefinite Programming. Optimization Methods and Software 11(1):613-623, 1999. DOI 10.1080/10556789908805765. Preprint.

julia-wrapper optimization sdp solverYou can now test the algoritms just using on our Docker image hosted on destructhub/project_euler just calling: docker-compose run async or docker-compose run sync. Assuming of course that you have a docker installation with docker-compose. On the end of execution, will be print a tabular-like structure with information about problem, language, time execution and if the answer is correct. The asynchronous build is written in Elixir, the synchronous version is written in Python. You can look on both systems at stats.exs and stats.py.

projecteuler solvers polyglot haskell common-lisp elixir contests mathematics cplusplus-11 solver
We have large collection of open source products. Follow the tags from
Tag Cloud >>

Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
**Add Projects.**