GSAT versus Simulated Annealing (1994)
Cached
Download Links
- [aida.intellektik.informatik.tu-darmstadt.de]
- [kirmes.inferenzsysteme.informatik.tu-darmstadt.de]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings of the European Conference on Artificial Intelligence |
| Citations: | 13 - 5 self |
BibTeX
@INPROCEEDINGS{Beringer94gsatversus,
author = {A. Beringer and G. Aschemann and H. Hoos and A. Weiß},
title = {GSAT versus Simulated Annealing},
booktitle = {Proceedings of the European Conference on Artificial Intelligence},
year = {1994},
pages = {130--134},
publisher = {John Wiley & Sons}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. The question of satisfiability for a given propositional formula arises in many areas of AI. Especially finding a model for a satisfiable formula is very important though known to be NP-complete. There exist complete algorithms for satisfiability testing like the Davis-Putnam-Algorithm, but they often do not construct a satisfying assignment for the formula, are not practically applicable for more than 400 or 500 variable problems, or in practice take too much time to find a solution. Recently, a (in practice) very fast, though incomplete, procedure, the model generating algorithm GSAT, has been introduced and several refined variants were created. Another method is Simulated Annealing (SA). Both approaches have already been compared with different results. We clarify these differences and do a more elaborate comparison showing that the performance of an already optimized variant of GSAT and an ordinary SA algorithm are more or less the same and that the attempts to further improve G...
