Sharing Information in Parallel Search with Search Space Partitioning
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Kacimi M; Gamper J (ACM, 2011)Diversifying search results of queries seeking for different view points about controversial topics is key to improving satisfaction of users. The challenge for finding different opinions is how to maximize the number of ...
Haiduc S; De Rosa G; Bavota G; Oliveto R; De Lucia A; Marcus A (IEEE, 2013)Developers search source code frequently during their daily tasks, to find pieces of code to reuse, to find where to implement changes, etc. Code search based on text retrieval (TR) techniques has been widely used in the ...
Bolzoni P; Helmer S (Springer, 2017)We develop an approach for solving rooted orienteering problems with category constraints as found in tourist trip planning and logistics. It is based on expanding partial solutions in a systematic way, prioritizing promising ...