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.
What do we know about the success and failure of international joint ventures? In search of relevance and holism Nippa, M; Beechler, S (Emerald, 2013)Rather than add another review of the numerous scholarly publications of success factors and performance of International Joint Ventures (IJVs) this study offers an overview of the extant research based on the findings, ...
Nippa, MC (Academy of Management, 2006)Of the many success factors for Research and Development activities that have been analyzed, leadership has been frequently highlighted. Many contributions emphasize the importance of leadership with regard to innovation ...