Results 11 to 20 of about 108,184 (297)
Computing with words with the use of inverse RDM models of membership functions [PDF]
International Journal of Applied Mathematics and Computer Science, 2015 Computing with words is a way to artificial, human-like thinking. The paper shows some new possibilities of solving difficult problems of computing with words which are offered by relative-distance-measure RDM models of fuzzy membership functions.
Piegat Andrzej, Pluciński Marcin
doaj +2 more sources
Assisting Users in Decisions Using Fuzzy Ontologies: Application in the Wine Market
Mathematics, 2020 Nowadays, wine has become a very popular item to purchase. There are a lot of brands and a lot of different types of wines that have different prices and characteristics.
Juan Antonio Morente-Molinera +4 more
doaj +1 more source
Some Advantages of the RDM-arithmetic of Intervally-Precisiated Values [PDF]
International Journal of Computational Intelligence Systems, 2015 Moore's interval arithmetic always provides the same results of arithmetic operations, e.g. [1, 3]+ [5, 9]= [6, 12]. But in real life problems, the operation result can be different, e.g. equal to [4, 7].
Andrzej Piegat, Marcin Plucinski
doaj +1 more source
COMPUTATION IN WORD-HYPERBOLIC GROUPS [PDF]
International Journal of Algebra and Computation, 2001 We describe two practical algorithms for computing with word-hyperbolic groups, both of which we have implemented. The first is a method for estimating the maximum width, if it exists, of geodesic bigons in the Cayley graph of a finitely presented group G.
David B. A. Epstein, Derek F. Holt
openaire +2 more sources
The Word Entropy and How to Compute It [PDF]
, 2017 The complexity function of an infinite word counts the number of its factors. For any positive function f , its exponential rate of growth E 0 (f) is lim n→∞ inf 1 n log f (n). We define a new quantity, the word entropy E W (f), as the maximal exponential growth rate of a complexity function smaller than f.
Sébastien Ferenczi +2 more
openaire +2 more sources
A Social Choice Analysis of the Borda Rule in a General Linguistic Framework [PDF]
International Journal of Computational Intelligence Systems, 2010 In this paper the Borda rule is extended by allowing the voters to show their preferences among alternatives through linguistic labels. To this aim, we need to add them up for assigning a qualification to each alternative and then to compare such ...
José Luis García-Lapresta +2 more
doaj +2 more sources
Computing Discriminating and Generic Words [PDF]
, 2012 We study the following three problems of computing generic or discriminating words for a given collection of documents. Given a pattern P and a threshold d, we want to report (i) all longest extensions of P which occur in at least d documents, (ii) all shortest extensions of P which occur in less than d documents, and (iii) all shortest extensions of P
Kucherov, Gregory +2 more
openaire +2 more sources
A University Teachers’ Teaching Performance Evaluation Method Based on Type-II Fuzzy Sets
Mathematics, 2021 This paper proposes a university teachers’ teaching performance evaluation method based on type-II fuzzy sets (T2 FSs), which solves the problems of fuzziness, complexity and uncertainty in teaching performance evaluation.
Xixia Sun +4 more
doaj +1 more source
On the Computational Complexity of Infinite Words
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavol Duris, Ján Manuch
openaire +2 more sources
Domain Specific Ontology on Computer Science [PDF]
, 2010 5th International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control -- SEP 02-04, 2009 -- Famagusta, CYPRUSIn this paper we introduce the application system based on the domain specific ontology ...
Salahli, M. A. +2 more
core +5 more sources