Asynchronous team algorithms for Boolean Satisfiability

@article{Rodrguez2007AsynchronousTA,
  title={Asynchronous team algorithms for Boolean Satisfiability},
  author={Carlos Rodr{\'i}guez and Marcos Villagra and B. Bar{\'a}n},
  journal={2007 2nd Bio-Inspired Models of Network, Information and Computing Systems},
  year={2007},
  pages={66-69}
}
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… Expand
MOP2P: Peer-to-peer platform applied to multiobjective optimization problems
Markets are Efficient if and Only if P = NP
Data Security in Distributed System Using Fully Homomorphic Encryption and Linear

References

SHOWING 1-10 OF 15 REFERENCES
Iterated Robust Tabu Search for MAX-SAT
On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT
  • H. Hoos
  • Computer Science
  • AAAI/IAAI
  • 1999
Local search strategies for satisfiability testing
Parallel Resolution of the Satisfiability Problem: A Survey
Algorithms for the satisfiability (SAT) problem: A survey
Ant Colony Optimization with Adaptive Fitness Function for Satisfiability Testing
GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem
Algorithms for the maximum satisfiability problem
An adaptive noise mechanism for walkSAT
  • H. Hoos
  • Computer Science
  • AAAI/IAAI
  • 2002
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
...
1
2
...