Randomization and Restart Strategies
The runtime for solving constraint satisfaction problems (CSP) and propositional satisfiability problems (SAT) using systematic backtracking search has been shown to exhibit great variability. Randomization and restarts is an effective technique for reducing such variability to achieve better exp...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
University of Waterloo
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/2923 |