The average running time of an algorithm as a midpoint between fuzzy sets (Q732662)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	The average running time of an algorithm as a midpoint between fuzzy sets	scientific article

Statements

scholarly article

The average running time of an algorithm as a midpoint between fuzzy sets (English)

Mathematical and Computer Modelling

publication date

12 October 2009

zbMATH Keywords

fuzzy set

asymmetric distance

weighted maximum distance

midpoint

running time of computing

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.mcm.2008.08.003

Definition of general aggregation operators through similarity relations

Averaging fuzzy biopolymers

Some similarity measures of intuitionistic fuzzy sets and their applications to multiple attribute decision making

A fuzzy closeness approach to fuzzy multi-attribute decision making

Distance and similarity measures for fuzzy operators

The Smyth Completion

Quasi-metric properties of complexity spaces

Sequence spaces and asymmetric norms in the theory of computational complexity.

Denotational semantics for programming languages, balanced quasi-metrics and fixed points

Representation theorems for fuzzy orders and quasi-metrics

Fuzzy submonoids, fuzzy preorders and quasi-metrics

Crisp and soft computing with hypercubical calculus. New approaches to modeling in cognitive science and technology with parity logic, fuzzy logic, and evolutionary computing

Fuzzy mathematics in medicine

The Complexity of Tree Automata and Logics of Programs

Difference Equations

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.MCM.2008.08.003

Sitelinks

Mathematics(1 entry)

mardi Publication:732662

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q732662&oldid=38466723"