Use stochastic local search algorithms to solve constraint satisfaction problems.
A constraint satisfaction problem, or CSP, is a problem which can be expressed as a set of variables, each with a particular domain, and a set of constraint relations between variables. A solution to a CSP is an assignment of a unique value to each variable such that all the of the constraint relations are satisfied.
Stochastic Local Search Based CSP Solver is a small, easy to use, Java based tool specially designed to help you create such a problem and solve it using and experimenting with a variety of stochastic local search algorithms.
Requirements:
· Java
Stochastic Local Search Based CSP Solver is a small, easy to use, Java based tool specially designed to help you create such a problem and solve it using and experimenting with a variety of stochastic local search algorithms.
Requirements:
· Java
| Developer: License / Price: Size / OS: Last Updated: | AIspace Freeware / FREE 383 KB / Windows All August 21st, 2010 |
| Download: | Stochastic Local Search Based CSP Solver 4.6.0 |
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.