title: Theoretical foundation for solving search problems by the method of maximum entropy
metadata.name: dc.contributor.author
metadata.value: Prokaev, Aleksandr N.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2023-10-23T18:04:57Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2023-10-23T18:04:57Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2023-09
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Prokaev A. N. Theoretical foundation for solving search problems by the method of maximum entropy. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2023, vol. 19, iss. 3, pp. 348–368. https://doi.org/10.21638/11701/spbu10.2023.304 (In Russian)
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu10.2023.304
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/44289
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: The traditional problem of search theory is to develop a search plan for a physical object in
  the sea or on land. Known algorithms for the optimal distribution of search resources mainly
  use the exponential detection function. If we consider the search problem more broadly —
  as a problem of searching for various information, then the detection function can differ
  significantly from the exponential one. In this case, the solutions obtained using traditional
  algorithms may be correct from the point of view of mathematics, but unacceptable from
  the point of view of logic. In this paper, this problem is solved on the basis of the maximum
  entropy principle. The theorems are proved, as well as their consequences for four types of
  detection functions, which make it possible to create algorithms for solving various search
  problems based on the principle of maximum entropy.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: ru
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 19; Issue 3
metadata.lang: -
metadata.name: dc.subject
metadata.value: information theory
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: search theory
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: uniformly optimal search plan
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: detection function
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: maximum entropy principle
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Theoretical foundation for solving search problems by the method of maximum entropy
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 04.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/44289/1/04.pdf
resources.format: Adobe PDF
resources.size: 737,57 kB