Finding a Given Number of Solutions to a System of Fuzzy Constraints

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00319782" target="_blank" >RIV/68407700:21230/18:00319782 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10559-018-0007-2" target="_blank" >http://dx.doi.org/10.1007/s10559-018-0007-2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10559-018-0007-2" target="_blank" >10.1007/s10559-018-0007-2</a>

Result language
angličtina
Original language name
Finding a Given Number of Solutions to a System of Fuzzy Constraints
Original language description
A minimax modification of a fuzzy constraint satisfaction problem is considered, where constraints determine not whether a given solution is feasible but the numerical value of satisfiability. The algorithm is proposed that finds a given number of solutions with the highest value of satisfiability in polynomial time for a subclass of problems with constraints invariant to some majority operator. It is important that knowing the operator itself is not required. Moreover, it is not necessary to guarantee its existence. For any system of fuzzy constraints, the algorithm either finds a given number of best solutions or declines the problem. The latter is only possible when no such operator exists.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA16-05872S" target="_blank" >GA16-05872S: Probabilistic Graphical Models and Deep Learning</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)