|
Avtomatika i Telemekhanika, 1984, Issue 5, Pages 53–62
(Mi at4709)
|
|
|
|
Developing Systems
A correcting algorithm for solution of siting problems
B. I. Gol'dengorin Alma-Ata
Abstract:
The proposed algorithm for solution of problems such as unification, siting, cove- Ting, and tracing a disjunctive normal form, minimal, shortest, containing a minimal number of letters with negations approximates irregular initial data as regular. A computing experiment confirms the effectiveness of the algorithm.
Received: 16.03.1982
Citation:
B. I. Gol'dengorin, “A correcting algorithm for solution of siting problems”, Avtomat. i Telemekh., 1984, no. 5, 53–62; Autom. Remote Control, 45:5 (1984), 590–598
Linking options:
https://www.mathnet.ru/eng/at4709 https://www.mathnet.ru/eng/at/y1984/i5/p53
|
Statistics & downloads: |
Abstract page: | 119 | Full-text PDF : | 101 | First page: | 2 |
|