Counting-based search: branching heuristics for constraint satisfaction problems (Q2887069)
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: Counting-based search: branching heuristics for constraint satisfaction problems |
scientific article; zbMATH DE number 6035674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting-based search: branching heuristics for constraint satisfaction problems |
scientific article; zbMATH DE number 6035674 |
Statements
16 May 2012
0 references
search heuristic
0 references
constraint programming
0 references
branching heuristics
0 references
Counting-based search: branching heuristics for constraint satisfaction problems (English)
0 references
0.8869051933288574
0 references
0.85543292760849
0 references
0.8554328680038452
0 references
0.8473552465438843
0 references
0.7969345450401306
0 references
