Results 271 to 280 of about 814,533 (290)
Some of the next articles are maybe not open access.
2011 Workshop-School on Theoretical Computer Science, 2011
Interval fuzzy sets allow us to deal not only with vagueness (lack of sharp class boundaries), but also with uncertainty (lack of information). The aim of this tutorial is to present some basic concepts about interval fuzzy numbers. Several concepts related to fuzzy sets are extended to the interval approach.
openaire +1 more source
Interval fuzzy sets allow us to deal not only with vagueness (lack of sharp class boundaries), but also with uncertainty (lack of information). The aim of this tutorial is to present some basic concepts about interval fuzzy numbers. Several concepts related to fuzzy sets are extended to the interval approach.
openaire +1 more source
The interval logarithmic number system
16th IEEE Symposium on Computer Arithmetic, 2003. Proceedings., 2004We introduce the interval logarithmic number system (ILNS), in which the logarithmic number system (LNS) is used as the underlying number system for interval arithmetic. The basic operations in ILNS are introduced and an efficient method for performing ILNS addition and subtraction is presented.
Mark G. Arnold +2 more
openaire +1 more source
On the Interval Number of a Triangulated Graph
Journal of Graph Theory, 1987AbstractThe interval number of a simple undirected graph G, denoted i(G), is the least nonnegative integer r for which we can assign to each vertex in G a collection of at most r intervals on the real line such that two distinct vertices v and w of G are adjacent if and only if some interval for v intersects some interval for w. For triangulated graphs
openaire +2 more sources
Comparison of Interval Numbers and Optimization of Interval-Parameter Systems
Automation and Remote Control, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the interval number of a chordal graph
Journal of Graph Theory, 1988AbstractThe interval number of a (simple, undirected) graph G is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t real intervals. A chordal (or triangulated) graph is one with no induced cycles on 4 or more vertices.
openaire +2 more sources
Fuzzy granulation of interval numbers
2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), 2011Investigation on fuzzy granulation method for interval numbers is of great importance. This paper aims to propose some methods of granulating interval numbers. Although there exit a few methods, some of them still have imperfections in granulating process or granulation results.
Mingxin Zhang 0009 +2 more
openaire +1 more source
Generating fuzzy intervals using gradual intervals and gradual numbers
Fuzzy Sets and Systems, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the Independence Number of Random Interval Graphs
Combinatorics, Probability and Computing, 2001A random interval graph of order n is generated by picking 2n numbers X1,…,X2n independently from the uniform distribution on [0,1] and considering the collection of n intervals with endpoints X2i−1 and X2i for i ∈ {1,…,n}. The graph vertices correspond to intervals. Two vertices are connected if the corresponding intervals intersect.
Stéphane Boucheron +1 more
openaire +2 more sources
On the interval approximation of a fuzzy number
Fuzzy Sets and Systems, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A note on the unit interval number and proper interval number of graphs.
Ars Comb., 2000The paper studies the intersection representation of graphs, where each vertex is assigned a set of intervals. The parameter \(i_u(G)\) is the smallest integer such that \(G\) has a representation by unit intervals where each vertex is assigned at most \(i_u(G)\) intervals.
openaire +1 more source