Boosting Combinatorial Search Through Randomization¶
Gomes, C. P., Selman, & Kautz, H. A. (1998). Boosting Combinatorial Search Through Randomization. Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), 431-437.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Random Restart Pulse
- The escape came not from smarter local moves but from starting over often enough
This sourceShows that repeated randomized restarts can escape heavy-tailed search runs and substantially reduce expected solution time.
- The escape came not from smarter local moves but from starting over often enough
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:4665696dafdb · see in the full table