Stochastic Local Search Based CSP SolverUse stochastic local search algorithms to solve constraint satisfaction problems. | |
Download |
Stochastic Local Search Based CSP Solver Ranking & Summary
Advertisement
Stochastic Local Search Based CSP Solver Tags
- Create generate list constraint constraint pitch constraint constraint programming constraint library stochastic fitting hybrid stochastic model Object Constraint Language Constraint Solver constraint integer stochastic process edit stochastic Petri-nets create stochastic Petri-nets stochastic Petri-nets editor Constraint Management Software customer satisfaction surveys satisfaction
Stochastic Local Search Based CSP Solver Description
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.
Stochastic Local Search Based CSP Solver Related Software