Zobrazeno 1 - 10
of 1 795
pro vyhledávání: '"the hard problem"'
Publikováno v:
Автоматизация технологических и бизнес-процессов, Vol 16, Iss 3, Pp 11-18 (2024)
Abstract. Background. Computer circuits enable almost every piece of electronics to function. An opportunity for their optimization was found in one of the ways to implement a circuit, which involves a decoder. Decoders are basic circuit components w
Externí odkaz:
https://doaj.org/article/66296cc5973b47c2b39700f971d7647a
Publikováno v:
PeerJ Computer Science, Vol 10, p e2558 (2024)
In recent years, fuzzy rule-based systems have been attracting great interest in interpretable and eXplainable Artificial Intelligence as ante-hoc methods. These systems represent knowledge that humans can easily understand, but since they are not in
Externí odkaz:
https://doaj.org/article/02d9dcd351ce4ecbb27d0a745ade63b2
Autor:
Yoram Gutfreund
Publikováno v:
Frontiers in Psychology, Vol 15 (2024)
Externí odkaz:
https://doaj.org/article/256d99bf860e4946ad5b8a41c30685dd
Autor:
Xinsheng Lai, Yulin Feng
Publikováno v:
IEEE Access, Vol 12, Pp 159920-159934 (2024)
Path planning is a fundamental function of mobile robots that have been nowadays used in a variety of areas. Evolutionary algorithms (EAs) have been experimentally showed to be efficient for the problem of mobile robot path planning, an NP-problem. H
Externí odkaz:
https://doaj.org/article/0553ce53aae442a8a60aef9dfd51509f
Publikováno v:
IEEE Access, Vol 12, Pp 30989-30999 (2024)
This paper considers a reconnaissance task allocation problem for multiple unmanned aerial vehicles (UAVs) in 3D urban environments. In this paper, we present an extended heterogeneous targets reconnaissance task allocation model which introduced cub
Externí odkaz:
https://doaj.org/article/201c12541154401ba626d46b8d105949
Publikováno v:
Mathematics, Vol 12, Iss 23, p 3657 (2024)
Minimal Strong Digraphs (MSDs) can be regarded as a generalization of the concept of tree to directed graphs. Their cyclic structure and some spectral properties have been studied in several articles. In this work, we further study some properties of
Externí odkaz:
https://doaj.org/article/4736f58323bd4a0eb04fe6be5352f1d6
Autor:
Miklos Molnar
Publikováno v:
Mathematics, Vol 12, Iss 22, p 3521 (2024)
The degree-constrained Steiner problem in graphs is well known in the literature. In an undirected graph, positive integer degree bounds are associated with nodes and positive costs with the edges. The goal is to find the minimum cost tree spanning a
Externí odkaz:
https://doaj.org/article/7ca4c06b437b4ab78063e30a53791dea
Autor:
Vitaly Kocharovsky
Publikováno v:
Entropy, Vol 26, Iss 11, p 926 (2024)
We propose boson sampling from a system of coupled photons and Bose–Einstein condensed atoms placed inside a multi-mode cavity as a simulation process testing the quantum advantage of quantum systems over classical computers. Consider a two-level a
Externí odkaz:
https://doaj.org/article/6519199c0ef14bca98eb01130ca3b6fb
Autor:
Miklos Molnar
Publikováno v:
Algorithms, Vol 17, Iss 10, p 467 (2024)
The minimum spanning tree problem in graphs under budget-type degree constraints (DCMST) is a well-known NP-hard problem. Spanning trees do not always exist, and the optimum can not be approximated within a constant factor. Recently, solutions have b
Externí odkaz:
https://doaj.org/article/e1607dd6421b417d8f6cd11aea9cc080
Autor:
Julia V. Sokolova
Publikováno v:
RUDN Journal of Philosophy, Vol 27, Iss 4, Pp 848-857 (2023)
The research is devoted to justification of the interdisciplinary approach in the study of consciousness. Studying consciousness as a phenomenon is a very divergent project, the mystery of its nature and appearance makes different ways of studying co
Externí odkaz:
https://doaj.org/article/a5c5acee31c94cfeace8466406cd8e6b