Results 31 to 40 of about 116,382 (312)
Ordinal notions of submodularity [PDF]
We consider several ordinal formulations of submodularity, defined for arbitrary binary relations on lattices. Two of these formulations are essentially due to Kreps [Kreps, D.M., 1979.
Chambers, Christopher P.+1 more
core +2 more sources
We introduce the concepts of a bipolar fuzzy reflexive, symmetric, and transitive relation. We study bipolar fuzzy analogues of many results concerning relationships between ordinary reflexive, symmetric, and transitive relations.
Jeong-Gon Lee, Kul Hur
doaj +1 more source
Interpolant-Based Transition Relation Approximation [PDF]
In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software model checkers typically use a weak approximation of the image. This can result in a failure to prove a property, even given an adequate set of predicates.
Kenneth L. McMillan, Ranjit Jhala
openaire +8 more sources
Fixed Point Theorems for Nonexpansive Mappings under Binary Relations
In the present article, we establish relation-theoretic fixed point theorems in a Banach space, satisfying the Opial condition, using the R-Krasnoselskii sequence. We observe that graphical versions (Fixed Point Theory Appl.
Aftab Alam+3 more
doaj +1 more source
In this paper we propose an in-depth analysis of a method, called the flow network method, which associates with any network a complete and quasi-transitive binary relation on its vertices.
Bubboloni, Daniela, Gori, Michele
core +2 more sources
Advance of performance modeling for Turbo receivers
Aiming at the performance modeling for Turbo receivers,the research results are summarized,in the mean-while,the characteristics and future trends are concluded in terms of equivalent model,transitive parameter,performance abstraction and transitive ...
Yun XUE, Bin JIANG, Xi-qi GAO
doaj +2 more sources
Rough Neutrosophic Multisets Relation with Application in Marketing Strategy [PDF]
The concepts of rough neutrosophic multisets can be easily extended to a relation, mainly since a relation is also a set, i.e. a subset of a Cartesian product.
Suriana Alias+2 more
doaj +1 more source
This manuscript includes certain results on fixed points under a generalized contraction involving a pair of shifting distance functions in the framework of metric space endowed with a class of transitive relation.
Ebrahem Ateatullah Algehyne+2 more
doaj +1 more source
Matroidal Structure of Rough Sets Based on Serial and Transitive Relations
The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery, and data mining. The theory of matroids is a generalization of
Yanfang Liu, William Zhu
doaj +1 more source
Refining Transitive and Pseudo-Transitive Relations at Web Scale
The publication of knowledge graphs on the Web in the form of RDF datasets, and the subsequent integration of such knowledge graphs are both essential to the idea of Linked Open Data. Combining such knowledge graphs can result in undesirable graph structures and even in logical inconsistencies.
Wang, Shuai+3 more
openaire +4 more sources