Branch \& Sample: A simple strategy for constraint satisfaction (Q1123646): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4144192 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3856120 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Branch-and-Bound Methods: A Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: General branch and bound, and its relation to \(A^*\) and \(AO^*\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Backtrack programming techniques / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Consistency in networks of relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A sufficient condition for backtrack-bounded search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorially implosive algorithms / rank | |||
Normal rank |
Revision as of 10:10, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Branch \& Sample: A simple strategy for constraint satisfaction |
scientific article |
Statements
Branch \& Sample: A simple strategy for constraint satisfaction (English)
0 references
1989
0 references
backtracking
0 references
combinatorial explosion
0 references
similarity function
0 references
automated design
0 references
constraint satisfaction
0 references