Constraint


Advertisement

Gecode  v.2. 1. 2001

Gecode is a toolkit for developing constraint-based systems and applications. Gecode provides a constraint solver with state-of-the-art performance while being modular and extensible.

Stochastic Local Search Based CSP Solver  v.4.6.0

Stochastic Local Search Based CSP Solver use stochastic local search algorithms to solve constraint satisfaction problems. Constraint satisfaction problems (CSPs) are pervasive in AI problems.





Advertisement

Consistency Based CSP Solver  v.4.6.1

Consistency Based CSP Solver create and solve constraint satisfaction problem. Constraint satisfaction problems (CSPs) are pervasive in AI problems.

Gecode for Linux  v.3.7.1

Gecode is a toolkit for developing constraint-based systems and applications.

Gecode for Mac OS X  v.3.7.1

Gecode is a toolkit for developing constraint-based systems and applications.

Gecode x64  v.3.7.1

Gecode is a toolkit for developing constraint-based systems and applications.

GNU Prolog  v.1 4

GNU Prolog is a free Prolog compiler with constraint solving over finite domains. GNU Prolog accepts Prolog constraint programs and produces native binaries (like gcc does from a C source). The obtained executable is then stand-alone.

QuadProg  v.1 5

Quadprog: Functions to solve Quadratic Programming Problems. This package contains routines and documentation for solving quadratic programming problems. Minimizes the function v = 0.5*x'*H*x f*x subject to the constraint A*x <= b.

A generic NTCC interpreter capable of RT  v.3.2

Ntccrt is an interpreter for the Non-deterministic Timed Concurrent Constraint (ntcc) calculus and its probabilistic extension (pntcc).

Arc Consistency Crossword Compiler  v.0.1

Arc Consistency Crossword Compiler (arccc) uses constraint satisfaction algorithms to fill crossword grids given a wordlist.

DragonBreath Engine  v.1.0

The DragonBreath Engine is a constraint solver based on local search.

ECLiPSe CLP  v.1.0

The ECLiPSe Constraint Logic Programming System is designed for solving combinatorial optimization problems, for the development of new constraint solver technology and their hybrids, and for the teaching of modelling, solving and search techniques.

Pages : All
Newest Reviews