Search Results for "open solver"

JaCoP is a Java Constraint Programming solver. It provides a significant number of (global) constraints to facilitate efficient modeling of combinatorial problems, as well as modular design of search. Documentation is available at project Web site. Please, note that the sources from version 4.0 are only available at GitHub.

Local-search based solver of Constraint Satisfaction and Optimization Problems.

YACS (Yet Another Constraint Solver) is a Java library and an object-oriented framework for constraint solvers. It supports propagating and solving of constraint satisfaction problems with finite and infinite domains (discrete values and real intervals).

Time based Traveling salesman problem solver. Using iterated local search algorithm, implements xkick perturbation Programmed in Java. A class to use the TSP Suite(Thomas Weise, Raymond Chiong, J ¨org L¨assig, Ke Tang, Shigeyoshi Tsutsui, Wenxiang Chen, Zbigniew Michalewicz, Xin Yao, Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem. 2014.),is implemented.

Solver solutions for constraint satisfaction problems (CSP): - CSP solver - CSP-based scheduler - CSP-based project management engine - CSP-based project management editor

DisChoco is a Distributed Constraint Reasoning Solver. Several Distributed Constraint Reasoning algorithms are implemented (like ABT, AFC, Adopt, ...). Users may easily implement and test their algorithms with DisChoco. contact: wahbi[at]users[dot]sourceforge[dot]net

Basic natural language processor capable of solving elementary math word problems such as: 1) John has 7 pencils. He buys 10 more pencils. How many pencils does he have in all? 2) There are 6 boys and 4 girls in a library. How many kids are there altogether? 3) Bob ran 8 miles and Stella ran 2 miles. How many miles did they run altogether? 4) What is the sum of 7 and 2? 5) What is 8 divided by 2? 6) What is the 10 subtracted by 2? 7) What is 2 subtracted from 10? Also shows users...

CSPFJ or CSP4J is an simple, hopefully fast CSP solver API written in Java featuring state-of-art search algorithms

Now with GUI! jiSudokuSolver is really a Java Sudoku master. It solves any puzzle, good or bad, even an empty one, usually in an instant, and it shows you how, every step. It also lets you play, generate, fix, test, reduce... just run startGUI.bat.

This is a continuation of the FreeCell Java Solver, because I was not able to access my original account anymore (likely due to sourceforge glitches), and I need to make updates to the program.

Moved to github: https://github.com/claycephus/MineSweeperWhiz Artificial intelligence solver as well as a human-playable mode for Mine Sweeper.

This is a FreeCell solitaire game solver written in the Java. It is fast and capable - it solves all of the first million Microsoft deals in about 4 hours - 99.99% of them in less than a second, and no deal takes more than 1 minute.

JASPWrapper is a potential "universal" java wrapper for ASP (answer set programming) inferential engine. It invokes native compiled solver and grounder by Java Virtual Machine and computes answers set analyzing and reifying output stream.

We provide here a tree constraint for the Choco (choco.sourceforge.net) Constraint Programming Solver.

VKAS uses genetic programming methods to find out the relationship among a set of independent and dependent variable. It is a problem solver software which uses evolutionary computing methods. When vkas is run, it creates a population of chromosomes at random. This population is then genetically modified and next population is generated. Each population is subjected to fitness calculation and if a suitable answer chromosome is found then vkas stops and the answer is printed. If a...

Cigol (logic, spelled backwards) is a deductive logic solver. It can be embedded inside a parent program or used from the command line. It has absolutely no relationship to Tom Mitchell's book on Machine Learning.