Partitioning Search Spaces of a Randomized Search

DOI10.3233/FI-2011-404zbMATH Open1230.68180OpenAlexW2103517840MaRDI QIDQ3100181FDOQ3100181

Ilkka Niemelä, Antti E. J. Hyvärinen, Tommi Junttila

Publication date: 22 November 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2011-404

zbMATH Keywords

SAT solvingrandomized searchdistributed constraint-based search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (2)

• Search-Space Partitioning for Parallelizing SMT Solvers
• Random search in a bounded area

Uses Software

• ManySAT
• MiniSat
• PSATO
• SATO
• PaMiraXT
• PaQuBE

This page was built for publication: Partitioning Search Spaces of a Randomized Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100181)