Разработка параллельного алгоритма решения задачи выполнимости для И-ИЛИ дерева в MS VISUAL STUDIO 2010; Технологии Microsoft в теории и практике программирования
| Parent link: | Технологии Microsoft в теории и практике программирования.— 2012.— [С. 52-54] |
|---|---|
| Hlavní autor: | |
| Korporativní autor: | |
| Shrnutí: | Заглавие с титульного листа. The satisfiability problem (SAT) is a decision problem that is known to be NP-complete. SAT is of central importance in various areas of computer science. There are numerous works devoted to the subject but most of them put strict constraints on the form of the Boolean expression. In this paper we develop a simple and fast genetic algorithm applicable to any Boolean formula or even combinational circuit. At the core of this algorithm lies universal and effective objective function based on AND/OR trees. The parallel implementation of this algorithm using PPL in Microsoft Visual Studio 2010 is described and studied. |
| Jazyk: | ruština |
| Vydáno: |
2012
|
| Edice: | Математическое моделирование и технологии высокопроизводительных вычислений |
| Témata: | |
| On-line přístup: | http://www.lib.tpu.ru/fulltext/c/2012/C28/016.pdf |
| Médium: | Elektronický zdroj Kapitola |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=611342 |
| Fyzický popis: | 1 файл (505 Кб) |
|---|---|
| Shrnutí: | Заглавие с титульного листа. The satisfiability problem (SAT) is a decision problem that is known to be NP-complete. SAT is of central importance in various areas of computer science. There are numerous works devoted to the subject but most of them put strict constraints on the form of the Boolean expression. In this paper we develop a simple and fast genetic algorithm applicable to any Boolean formula or even combinational circuit. At the core of this algorithm lies universal and effective objective function based on AND/OR trees. The parallel implementation of this algorithm using PPL in Microsoft Visual Studio 2010 is described and studied. |