Results 21 to 30 of about 308,543 (305)

Pairwise Stability in Two Sided Market with Strictly Increasing Valuation Functions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
This paper deals with two-sided matching market with two disjoint sets, i.e. the set of buyers and the set of sellers. Each seller can trade with at most with one buyer and vice versa.
Yasir Ali, Asma Javaid
doaj   +1 more source

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability [PDF]

open access: yesTheoretiCS
We show that feasibility of the $t^\text{th}$ level of the Lasserre semidefinite programming hierarchy for graph isomorphism can be expressed as a homomorphism indistinguishability relation.
David E. Roberson, Tim Seppelt
doaj   +1 more source

ELEMENTS OF ‘‘FUZZY LOGIC’’ AS A COMPONENT OF PROFESSIONAL AND PEDAGOGICAL TRAINING OF FUTURE MATHEMATICS AND INFORMATICS TEACHERS

open access: yesИнтеграция образования, 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

Enterprise Integration & API Economy

open access: yes, 2022
Mr. Ovais Khan is delivering lecture in the Seminar Series \u27Enterprise Integration & API Economy\u27 organized by IBA, School of Mathematics and Computer Science (SMCS) on 24th March 2022.https://ir.iba.edu.pk/training-events-gallery/1052/thumbnail ...
School of Mathematics and Computer Science (SMCS)
core   +4 more sources

Stable gonality is computable [PDF]

open access: yesDiscrete 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]

open access: yesComputer 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  

Educational and Research Projects on the Analysis of the Dynamic Quality of Technical Systems and Processes Using their Mathematical Models

open access: yesСовременные информационные технологии и 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]

open access: yesLogical 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

Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs [PDF]

open access: yesLogical 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

Home - About - Disclaimer - Privacy