A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers

Author： Jurkowiak Bernard   Li Chu   Utard Gil  

Publisher： Springer Publishing Company

ISSN： 0168-7433

Source： Journal of Automated Reasoning, Vol.34, Iss.1, 2005-01, pp. : 73-101

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Exact Max-SAT solvers for over-constrained problems

By Argelich Josep   Manyà Felip  

Journal of Heuristics, Vol. 12, Iss. 4-5, 2006-09 ,pp. : 375-392

Springer Publishing Company

Access to resources Recommend Favorite

Parallelization of an ant-based clustering approach

By Gunes Ozlem Gemici   Uyar A. Sima  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 39, Iss. 4, 2010-01 ,pp. : 656-677

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Efficient distributed SAT and SAT-based distributed Bounded Model Checking

By Ganai Malay   Gupta Aarti   Yang Zijiang   Ashar Pranav  

International Journal on Software Tools for Technology Transfer, Vol. 8, Iss. 4-5, 2006-08 ,pp. : 387-396

Springer Publishing Company

Access to resources Recommend Favorite

Proactive Mobile Fog Computing using Work Stealing: Data Processing at the Edge

By  

International Journal of Mobile Computing and Multimedia Communications (IJMCMC), Vol. 8, Iss. 4, 2017-10 ,pp. : 1-19

IGI Global_journal

Access to resources Recommend Favorite

Resolution-based lower bounds in MaxSAT

By Li Chu  

Constraints, Vol. 15, Iss. 4, 2010-10 ,pp. : 456-484

Springer Publishing Company

Access to resources Recommend Favorite