Performances of pure random walk algorithms on constraint satisfaction problems with growing domains (Q328683)
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: Performances of pure random walk algorithms on constraint satisfaction problems with growing domains |
scientific article; zbMATH DE number 6641526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performances of pure random walk algorithms on constraint satisfaction problems with growing domains |
scientific article; zbMATH DE number 6641526 |
Statements
Performances of pure random walk algorithms on constraint satisfaction problems with growing domains (English)
0 references
20 October 2016
0 references
constraint satisfaction problems
0 references
model RB
0 references
random walk
0 references
local search algorithms
0 references
0 references
0 references
0 references
0.9809034
0 references
0.8786231
0 references
0.86805487
0 references
0.86349833
0 references
0.86297536
0 references
0.8602544
0 references
