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 5, Pages 149–155 (Mi at4445)  
Simulation of Behavior and Intelligence

Hill-climbing problems in finite sets of monotone measure

M. V. Sapir

Sverdlovsk
Full-text PDF (1144 kB)
Abstract: Two (dual) statements are given of the problem of search for nesting-extremal subsets which satisfy the constraint on the value of the monotone function. Two algorithms of solving the problems are proposed and their efficiency studied. Examples of data analysis problems are provided.

Received: 22.11.1985
Document Type: Article
UDC: 62-506.1
Language: Russian
Citation: M. V. Sapir, “Hill-climbing problems in finite sets of monotone measure”, Avtomat. i Telemekh., 1987, no. 5, 149–155
Citation in format AMSBIB
\Bibitem{Sap87}
\by M.~V.~Sapir
\paper Hill-climbing problems in finite sets of monotone measure
\jour Avtomat. i Telemekh.
\yr 1987
\issue 5
\pages 149--155
\mathnet{http://mi.mathnet.ru/at4445}
Linking options:
  • https://www.mathnet.ru/eng/at4445
  • https://www.mathnet.ru/eng/at/y1987/i5/p149
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025