Sciweavers

4047 search results - page 54 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
ANOR
2008
69views more  ANOR 2008»
14 years 12 months ago
NP-hardness results for the aggregation of linear orders into median orders
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
Olivier Hudry
DM
2008
107views more  DM 2008»
14 years 10 months ago
Set maps, umbral calculus, and the chromatic polynomial
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = TU=S pT (x)pU (y). Using umbral calculus, we give a formula for t...
Gus Wiseman
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 12 months ago
An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set
A fixed-point free involution on a finite set S is defined as a bijection I : S S such as e S, I(I(e)) = e and e S, I(e) = e. In this article, the fixed-point free involutions ...
Cyril Prissette
RSFDGRC
2005
Springer
133views Data Mining» more  RSFDGRC 2005»
15 years 5 months ago
Rough Set Approximation Based on Dynamic Granulation
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is defined. Some properties o...
Jiye Liang, Yuhua Qian, Chengyuan Chu, Deyu Li, Ju...
CORR
2007
Springer
87views Education» more  CORR 2007»
14 years 11 months ago
Entropy of capacities on lattices and set systems
We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability mea...
Aoi Honda, Michel Grabisch