Results 1  10
of
954
Fuzzy kappa for the agreement measure of fuzzy classifications $
"... In this paper, we propose an assessment method of agreement between fuzzy sets, called fuzzy Kappa which is deduced from the concept of Cohen’s Kappa statistic. In fuzzy case, the Cohen’s Kappa coefficient can be calculated generally by transforming the fuzzy sets into some crisp acut subsets. Whil ..."
Abstract
 Add to MetaCart
In this paper, we propose an assessment method of agreement between fuzzy sets, called fuzzy Kappa which is deduced from the concept of Cohen’s Kappa statistic. In fuzzy case, the Cohen’s Kappa coefficient can be calculated generally by transforming the fuzzy sets into some crisp acut subsets
Drowsy Caches: Simple Techniques for Reducing Leakage Power
 PROC. 29TH INT’L SYMP. COMPUTER ARCHITECTURE
, 2002
"... Onchip caches represent a sizable fraction of the total power consumption of microprocessors. Although large caches can significantly improve performance, they have the potential to increase power consumption. As feature sizes shrink, the dominant component of this power loss will be leakage. Howev ..."
Abstract

Cited by 251 (1 self)
 Add to MetaCart
. However, during a fixed period of time the activity in a cache is only centered on a small subset of the lines. This behavior can be exploited to cut the leakage power of large caches by putting the cold cache lines into a state preserving, lowpower drowsy mode. Moving lines into and out of drowsy state
A BRANCHANDCUT ALGORITHM FOR THE RESOLUTION OF LARGESCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS
, 1991
"... An algorithm is described for solving largescale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cuttingplane procedure that exploits a subset of the system of linear inequalities defining the convex hull of the in ..."
Abstract

Cited by 205 (7 self)
 Add to MetaCart
An algorithm is described for solving largescale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cuttingplane procedure that exploits a subset of the system of linear inequalities defining the convex hull
The Complexity of Multiterminal Cuts
 SIAM Journal on Computing
, 1994
"... In the Multiterminal Cut problem we are given an edgeweighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the mincut, maxflow problem, and ..."
Abstract

Cited by 194 (0 self)
 Add to MetaCart
In the Multiterminal Cut problem we are given an edgeweighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the mincut, maxflow problem
On Significant Crisp Representatives of Fuzzy Regions in Colour Images
"... Abstract — In this paper we propose a technique to obtain a set of crisp representatives of an imprecise region in color images. In our approach, we start by obtaining a fuzzy model of the region by employing a fuzzy region growing procedure. The set of crisp representatives is obtained from that mo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
that model as the set of αcuts corresponding to maximal variations of homogeneity. Several experiments and a comparison with both crisp and fuzzy techniques are provided, showing the suitability of the proposal against other approaches.
www.elsevier.com/locate/fss Measure of a fuzzy set. The cut approach in the $nite case
, 2000
"... In this paper we study the problem of constructing a Sugeno measure 2m on a suitable family S ̃ of fuzzy subsets of a space . More precisely, we suppose that there exists a measure m on a crisp measurable space (;S), we request that all the cuts of the elements of S ̃ belong to the algebra S of the ..."
Abstract
 Add to MetaCart
In this paper we study the problem of constructing a Sugeno measure 2m on a suitable family S ̃ of fuzzy subsets of a space . More precisely, we suppose that there exists a measure m on a crisp measurable space (;S), we request that all the cuts of the elements of S ̃ belong to the algebra
Characterizing Fuzzy Modal Semantics by fuzzy multimodal systems with crisp accessibility relations
"... Abstract — In [1] the authors considered finitelyvalued modal logics with Kripke style semantics where both propositions and the accessibility relation are valued over a finite residuated lattice. Unfortunately, the necessity operator does not satisfy in general the normality axiom (K). In this pap ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the crisp accessibility relation given by the corresponding cut of the finitelyvalued original accessibility relation. This multimodal logic is somehow more appealing than the original modal one because axiom (K) holds for each necessity operator. In this paper we axiomatize this multimodal logic and we
Characterizing Fuzzy Modal Semantics through a Crisp Multimodal System
"... Abstract — In [1] the authors considered finitelyvalued modal logics with Kripke style semantics where both propositions and the accessibility relation are finitelyvalued over a finite residuated lattice. Unfortunately, the necessity operator does not satisfy the normality axiom (K). In this paper ..."
Abstract
 Add to MetaCart
). In this paper we consider a different approach based on introducing a multimodal logic where the previous necessity operator is replaced with a family, parametrized by truth values different from zero, of necessity operators each one semantically defined using the crisp accessibility relation given
Semantics of SubsetLogic Languages
, 1994
"... This dissertation examines the semantics of a new paradigm of logic programming called subsetlogic programming. The most novel construct of a subsetlogic program is the subset assertion, which in conjuction with the more conventional relational and equational assertions provide a declarative alte ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This dissertation examines the semantics of a new paradigm of logic programming called subsetlogic programming. The most novel construct of a subsetlogic program is the subset assertion, which in conjuction with the more conventional relational and equational assertions provide a declarative
Results 1  10
of
954