Algorithms for the maximum satisfiability problem.
Analýza starých a nových algoritmov pre úlohu maximálnej dostatočnosti. Prehľad starších známych heuristík. Adaptácia niektorých moderných algoritmov. Návrh algoritmu a empirické dôkazy jeho vyššej efektívnosti oproti algoritmom, známym z literatúry.
Salvato in:
| Autore principale: | |
|---|---|
| Altri autori: | |
| Natura: | Capitolo di libro |
| Lingua: | inglese |
| Soggetti: | |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
Documenti analoghi: Algorithms for the maximum satisfiability problem.
- Solving vehicle routing problem using bee colony optimization algorithm
- Computational aspects of a branch and bound algorithm for quadratic zero-one programming.
- Truncated nonlinear ABS algorithm and its convergence property.
- Schröder-like algorithms for multiple complex zeros of a polynomial.
- <A> numerical method for quasilinear singular perturbation problems with turning points.
- Computer Tools for Solving the Traveling Salesman Problem