Minimal solutions of generalized fuzzy relational equations: Probabilistic algorithm based on greedy approach

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F15%3A33155573" target="_blank" >RIV/61989592:15310/15:33155573 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S0165011414000645" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0165011414000645</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.fss.2014.02.012" target="_blank" >10.1016/j.fss.2014.02.012</a>

Result language
angličtina
Original language name
Minimal solutions of generalized fuzzy relational equations: Probabilistic algorithm based on greedy approach
Original language description
The paper deals with generalized fuzzy relational equations that are defined within a recently introduced framework of sup-preserving aggregation structures. Generalized fuzzy relational equations subsume all previously studied types of fuzzy relationalequations, namely those that are based on sup-t-norm and inf-residuum compositions. The paper contributes to previous studies of generalized fuzzy relational equations by presenting a method for constructing all minimal solutions and, consequently, for determining the whole solution set for any given generalized fuzzy relational equation that is solvable and for which every solution is bounded from below by a minimal solution. Moreover, in the paper we present a simple probabilistic algorithm for finding all minimal solutions.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)