Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Alexander Rybalov"'
Publikováno v:
Robotics, Vol 12, Iss 3, p 76 (2023)
In this paper, we suggest an implementation of non-commutative logic and apply its operators for decision-making in a group of autonomous agents. The suggested operators extend the uninorm and absorbing norm aggregators and use an additional asymmetr
Externí odkaz:
https://doaj.org/article/be543024653d45428ac0055cd8256f9a
Autor:
Eugene Kagan, Alexander Rybalov
Publikováno v:
Entropy, Vol 24, Iss 6, p 790 (2022)
The paper deals with the methods of handling imperfect information and the control of mobile robots acting under uncertainty. It is assumed that the robots act in autonomous regime and are controlled internally without referring the externally define
Externí odkaz:
https://doaj.org/article/84343faf2669413f97cd2bd18deba9fc
Publikováno v:
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems. 30:1-18
The paper attempts to bridge the gap between widely accepted models of biological systems based on the Tsetlin automata acting in random environment and traditional artificial neural networks that consist of the McCalloch and Pitts neurons. Using rec
Autor:
Evgeny Kagan, Alexander Rybalov
Publikováno v:
Operations Research Forum. 3
Publikováno v:
ICAART (2)
Publikováno v:
2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE).
In the report, a simple complex-valued logic is derived from the algebraic structure with uninorm and absorbing norm aggregators. Such construction forms a unified framework for probabilistic and complex fuzzy logics and provides a basis for modeling
Autor:
Alexander Rybalov
Publikováno v:
Journal of Physics: Conference Series. 1901:012046
This article is devoted to investigation of generic complexity of universal and elementary theories of finite algebraic structures with universal set with more than one element of finite predicate signature with equality. We prove that there are no p
Autor:
Alexander Rybalov, Artem Shevlyakov
Publikováno v:
Journal of Physics: Conference Series. 1901:012047
The paper is devoted by investigation of generic complexity of the algorithmic problem of solving of systems of equations in finite groups, finite semigroups and finite fields. We show that if this problem is intractable in the worst case and P = BPP
Autor:
Alexander Rybalov
Publikováno v:
Journal of Physics: Conference Series. 1901:012045
This article is devoted to the investigation of generic complexity of the problem of searching of isomorphism for finite semigroups. That problem can be formulated as follows. For any pair of isomorphic finite semigroup Si and S2 with elements {1, 2,
Autor:
Alexander Rybalov
Publikováno v:
Journal of Physics: Conference Series. 1546:012100
Kapovich, Myasnikov, Schupp and Shpilrain in 2003 developed generic approach to algorithmic problems, which considers an algorithmic problem on “most” of the inputs instead of the entire domain and ignores it on the rest of inputs. Myasnikov, Ush