Results 31 to 40 of about 121,750 (289)

Transitive closure and betweenness relations

open access: yesFuzzy Sets and Systems, 2001
Indistinguishability operators fuzzify the concept of equivalence relation and have been proved a useful tool in theoretical studies as well as in di0erent applications such as fuzzy control or approximate reasoning. One interesting problem is their construction. There are di0erent ways depending on how the data are given and on their future use.
Boixader Ibáñez, Dionís   +2 more
openaire   +3 more sources

On the (min,max)-transitivity of some intuitionistic fuzzy binary relations associated with probability distributions on pre-orders [PDF]

open access: yesNotes on IFS
In this paper, we introduce an intuitionistic fuzzy binary relation on a finite universe generated by a probability distribution on a set of complete pre-orders of the universe.
Landry Ngibasona   +2 more
doaj   +1 more source

Reasons and Means to Model Preferences as Incomplete [PDF]

open access: yes, 2017
Literature involving preferences of artificial agents or human beings often assume their preferences can be represented using a complete transitive binary relation. Much has been written however on different models of preferences.
A Tsoukiàs   +45 more
core   +2 more sources

Transitive closure of interval-valued relations [PDF]

open access: yes2008 3rd International Conference on Intelligent System and Knowledge Engineering, 2008
Peer ...
González del Campo, Ramón   +2 more
openaire   +3 more sources

Advance of performance modeling for Turbo receivers

open access: yesTongxin xuebao, 2014
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

Matroidal Structure of Rough Sets Based on Serial and Transitive Relations

open access: yesJournal of Applied Mathematics, 2012
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

Leveraging transitive relations for crowdsourced joins [PDF]

open access: yesProceedings of the 2013 ACM SIGMOD International Conference on Management of Data, 2013
The development of crowdsourced query processing systems has recently attracted a significant attention in the database community. A variety of crowdsourced queries have been investigated. In this paper, we focus on the crowdsourced join query which aims to utilize humans to find all pairs of matching objects from two collections.
Jiannan Wang 0001   +4 more
openaire   +2 more sources

Rough Neutrosophic Multisets Relation with Application in Marketing Strategy [PDF]

open access: yesNeutrosophic Sets and Systems, 2018
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

Fixed Point Theorems for Nonexpansive Mappings under Binary Relations

open access: yesMathematics, 2021
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

Relational Contractions Involving Shifting Distance Functions with Applications to Boundary Value Problems

open access: yesAxioms, 2023
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

Home - About - Disclaimer - Privacy