Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems (Q3569759)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems |
scientific article; zbMATH DE number 5724137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems |
scientific article; zbMATH DE number 5724137 |
Statements
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems (English)
0 references
22 June 2010
0 references
constraint satisfaction problem
0 references
CSP
0 references
Lovász local lemma
0 references
SAT
0 references
satisfiability algorithm
0 references
stochastic local search
0 references
SLS
0 references
0.90054196
0 references
0.8852632
0 references
0.8815685
0 references
0.8815685
0 references
0.87911737
0 references
0.87831676
0 references
0.8774482
0 references
