Estimating parallel runtimes for randomized algorithms in constraint solving

This paper presents a detailed analysis of the scalability and parallelization of Local Search algorithms for constraint-based and SAT (Boolean satisfiability) solvers. We propose a framework to estimate the parallel performance of a given algorithm by analyzing the runtime behavior of its sequentia...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of heuristics Ročník 22; číslo 4; s. 613 - 648
Hlavní autori:	Truchet, Charlotte, Arbelaez, Alejandro, Richoux, Florian, Codognet, Philippe
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2016 Springer Nature B.V Springer Verlag
Predmet:	Algorithms Artificial Intelligence Boolean Calculus of Variations and Optimal Control; Optimization Combinatorics Computer Science Distributed, Parallel, and Cluster Computing Estimating techniques Management Science Mathematical analysis Mathematics Mathematics and Statistics Methods Operations Research Operations Research/Decision Theory Parallel processing Performance evaluation Propagation Random variables Studies Parallel processing Performance model Randomized constraint solving Constraint solving
ISSN:	1381-1231, 1572-9397
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!