Sciweavers

2356 search results - page 9 / 472
» Characterizations of postman sets
Sort
View
ISCI
2011
13 years 5 months ago
Sequential covering rule induction algorithm for variable consistency rough set approaches
We present a general rule induction algorithm based on sequential covering, suitable for variable consistency rough set approaches. This algorithm, called VC-DomLEM, can be used f...
Jerzy Blaszczynski, Roman Slowinski, Marcin Szelag
TSMC
2010
13 years 5 months ago
Incomplete Multigranulation Rough Set
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
Yuhua Qian, Jiye Liang, Chuangyin Dang
DAC
2011
ACM
12 years 10 months ago
Supervised design space exploration by compositional approximation of Pareto sets
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...
Hung-Yi Liu, Ilias Diakonikolas, Michele Petracca,...
ASP
2003
Springer
14 years 4 months ago
Graphs and colorings for answer set programming: Abridged Report
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
Kathrin Konczak, Torsten Schaub, Thomas Linke
EUSFLAT
2003
106views Fuzzy Logic» more  EUSFLAT 2003»
14 years 7 days ago
Intuitionistic fuzzy sets or orthopair fuzzy sets?
Intuitionistic Fuzzy Sets (IFS) are defined as pairs of mutually orthogonal fuzzy sets. We discuss this approach from an algebraic point of view. As a result we characterize two ...
Gianpiero Cattaneo, Davide Ciucci