Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 1987, Issue 1, Pages 115–121 (Mi at4361)  
Simulation of Behavior and Intelligence

An efficient algorithm of obtaining a set of undominated options of processes to be decomposed

B. A. Berezovskiy, L. A. Kontorer

Moscow
Full-text PDF (1137 kB)
Abstract: An algorithm is proposed whereby options are generated which are undominated in the binary relation in the criterial space. The structure of the process to be decomposed is assumed specified for the set of options. Under certain constraints imposed on consistence of the criterial mapping and the binary relations an analog of the Bellman principle which holds for multicriterial problems is used in development of the algorithm.

Received: 04.12.1985
Document Type: Article
UDC: 62-505.7:65.01
Language: Russian
Citation: B. A. Berezovskiy, L. A. Kontorer, “An efficient algorithm of obtaining a set of undominated options of processes to be decomposed”, Avtomat. i Telemekh., 1987, no. 1, 115–121
Citation in format AMSBIB
\Bibitem{BerKon87}
\by B.~A.~Berezovskiy, L.~A.~Kontorer
\paper An efficient algorithm of obtaining a set of undominated options of processes to be decomposed
\jour Avtomat. i Telemekh.
\yr 1987
\issue 1
\pages 115--121
\mathnet{http://mi.mathnet.ru/at4361}
Linking options:
  • https://www.mathnet.ru/eng/at4361
  • https://www.mathnet.ru/eng/at/y1987/i1/p115
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:274
    Full-text PDF :152
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024