Asynchronous team algorithms for Boolean Satisfiability Export

@inproceedings{citeulike:4834518, abstract = {The Boolean Satisfiability Problem or SAT is one of the most important problems in computer science. Nowadays, there are different types of algorithms to solve instances with thousands of variables, and much research is being carried out looking for more efficient algorithms to solve larger and harder instances. This work proposes the utilization of a Team Algorithm (TA) strategy combining different local search algorithms for SAT as WalkSAT, R-Novelty+, Adaptive Novelty+, RSAPS, IROTS and SAMD. TAs allow the combination of different algorithms that interact with each other searching for a good global solution. Experimental results show that the proposed TA is a general strategy capable of obtaining promising results for a variety of instances.}, author = {Rodriguez, C. and Villagra, M. and Baran, B.}, booktitle = {Bio-Inspired Models of Network, Information and Computing Systems, 2007. Bionetics 2007. 2nd}, citeulike-article-id = {4834518}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/BIMNICS.2007.4610083}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4610083}, doi = {10.1109/BIMNICS.2007.4610083}, journal = {Bio-Inspired Models of Network, Information and Computing Systems, 2007. Bionetics 2007. 2nd}, keywords = {algorithms, local, sat, search, team}, pages = {66--69}, posted-at = {2009-06-13 09:29:25}, priority = {0}, title = {Asynchronous team algorithms for Boolean Satisfiability}, url = {http://dx.doi.org/10.1109/BIMNICS.2007.4610083}, year = {2007} }

TY - CONF ID - citeulike:4834518 L3 - citeulike-article-id:4834518 N2 - The Boolean Satisfiability Problem or SAT is one of the most important problems in computer science. Nowadays, there are different types of algorithms to solve instances with thousands of variables, and much research is being carried out looking for more efficient algorithms to solve larger and harder instances. This work proposes the utilization of a Team Algorithm (TA) strategy combining different local search algorithms for SAT as WalkSAT, R-Novelty+, Adaptive Novelty+, RSAPS, IROTS and SAMD. TAs allow the combination of different algorithms that interact with each other searching for a good global solution. Experimental results show that the proposed TA is a general strategy capable of obtaining promising results for a variety of instances. JF - Bio-Inspired Models of Network, Information and Computing Systems, 2007. Bionetics 2007. 2nd EP - 69 TI - Asynchronous team algorithms for Boolean Satisfiability T2 - Bio-Inspired Models of Network, Information and Computing Systems, 2007. Bionetics 2007. 2nd SP - 66 KW - algorithms KW - local KW - sat KW - search KW - team AU - Rodriguez, C AU - Villagra, M AU - Baran, B PY - 2007/// UR - http://dx.doi.org/10.1109/BIMNICS.2007.4610083 ER -