Logo image
Back
Sharing Information in Parallel Search with Search Space Partitioning
Conference proceeding   Peer reviewed

Sharing Information in Parallel Search with Search Space Partitioning

Davide Lanti and Norbert Manthey
Learning and Intelligent Optimization: 7th International Conference, LION 7, Catania, Italy, January 7-11, 2013, Revised Selected Papers, Vol.7997, pp.52-58
Lecture Notes in Computer Science, 7997
Learning and Intelligent Optimization - 7th International Conference LION (Catania, 07/01/2013 - 11/01/2013)
2013
DOI: https://doi.org/10.1007/978-3-642-44973-4
Handle:
https://hdl.handle.net/10863/5212

Abstract

In this paper we propose a new approach to share information among the computation units of an iterative search partitioning parallel SAT solver by approximating validity. Experimental results show the streh of the approach, against both existing sharing techniques and absence of sharing. With the improved clause sharing, out of 600 instances we could solve 13 more than previous sharing techniques. © 2013 Springer-Verlag.
url
https://link.springer.com/chapter/10.1007/978-3-642-44973-4_6View

Details

Metrics

17 Record Views