A carregar...
A comparative runtime analysis of heuristic algorithms for satisfiability problems
The satisfiability problem is a basic core NP-complete problem. In recent years, a lot of heuristic algorithms have been developed to solve this problem, and many experiments have evaluated and compared the performance of different heuristic algorithms. However, rigorous theoretical analysis and com...
Na minha lista:
| Main Authors: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2009
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2774825/ https://ncbi.nlm.nih.gov/pubmed/20126510 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.artint.2008.11.002 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|