Results 21 to 30 of about 265,378 (263)
Интеграция образования, 2017 Introduction: the article describes the application of fuzzy logic in the teaching of mathematics. This theory has a great creative ability to solve various pedagogical tasks for the implementation of the developing and applied functions of school ...
Mikhail A. Rodionov +2 more
doaj +1 more source
Stable gonality is computable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the minimum number
Ragnar Groot Koerkamp +1 more
doaj +1 more source
In memoriam of Yurii Rogozhin [PDF]
Computer Science Journal of Moldova, 2019 November 13, 2019 would be the 70th birthday of Prof. Yurii Rogozhin. Dr. hab.~Yurii Rogozhin (November 13, 1949 $\dagger$ March 10, 2014) was a worldwide known computer scientist with diverse interests, ranged from finding small universal Turing ...
The staff of the Vladimir Andrunachievici Institute of Mathematics and Computer Science
doaj
Современные информационные технологии и IT-образование, 2021 Some aspects of the process of mathematical modeling and computational experiment are considered. The modeling process is considered as a method of predicting the behavior of dynamic systems and processes, which allows implementing a chain from a full ...
Sergey Strebulyaev, Daria Sirotkina
doaj +1 more source
On p/q-recognisable sets [PDF]
Logical Methods in Computer Science, 2021 Let p/q be a rational number. Numeration in base p/q is defined by a function that evaluates each finite word over A_p={0,1,...,p-1} to some rational number. We let N_p/q denote the image of this evaluation function.
Victor Marsault
doaj +1 more source
An Alternate Proof of Near-Optimal Light Spanners [PDF]
TheoretiCSIn 2016, a breakthrough result of Chechik and Wulff-Nilsen [SODA '16] established that every $n$-node graph $G$ has a $(1+\varepsilon)(2k-1)$-spanner of lightness $O_{\varepsilon}(n^{1/k})$, and recent followup work by Le and Solomon [STOC '23 ...
Greg Bodwin
doaj +1 more source
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs [PDF]
Logical Methods in Computer Science, 2023 We study countably infinite Markov decision processes (MDPs) with real-valued transition rewards. Every infinite run induces the following sequences of payoffs: 1. Point payoff (the sequence of directly seen transition rewards), 2.
Richard Mayr, Eric Munday
doaj +1 more source
International Journal of Research in E-Learning, 2020 The requirements for the training of mathematics and computer science teachers to use specialized mathematical software in professional activities are substantiated in the article.
Olena Semenikhina +2 more
doaj +1 more source
Permissive Controller Synthesis for Probabilistic Systems [PDF]
Logical Methods in Computer Science, 2015 We propose novel controller synthesis techniques for probabilistic systems modelled using stochastic two-player games: one player acts as a controller, the second represents its environment, and probability is used to capture uncertainty arising due to ...
Klaus Drager +4 more
doaj +1 more source
Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis [PDF]
Logical Methods in Computer Science, 2012 We introduce a new domain for finding precise numerical invariants of programs by abstract interpretation. This domain, which consists of level sets of non-linear functions, generalizes the domain of linear "templates" introduced by Manna ...
Assalé Adjé +2 more
doaj +1 more source