Sciweavers

11949 search results - page 93 / 2390
» Some results on (a:b)-choosability
Sort
View
108
Voted
COCO
1995
Springer
113views Algorithms» more  COCO 1995»
15 years 4 months ago
On the Structure of Low Sets
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
Johannes Köbler
93
Voted
JAC
2008
15 years 2 months ago
Neighborhood transformations on graph automata
Abstract. We consider simulations of graph automata. We introduce two local transformations on the neighborhood: splitting and merging. We explain how to use such transformations, ...
Bruno Martin, Christophe Papazian
104
Voted
AAAI
1990
15 years 2 months ago
What Should Be Minimized in a Decision Tree?
In this paper, we address the issue of evaluating decision trees generated from training examples by a learning algorithm. We give a set of performance measures and show how some ...
Usama M. Fayyad, Keki B. Irani
76
Voted
FSS
2008
117views more  FSS 2008»
15 years 27 days ago
(S, N)- and R-implications: A state-of-the-art survey
In this work we give a state-of-the-art review of two of the most established classes of fuzzy implications, viz., (S, N)- and R-implications. Firstly, we discuss their properties...
Michal Baczynski, Balasubramaniam Jayaram
100
Voted
LOGCOM
2006
78views more  LOGCOM 2006»
15 years 23 days ago
On Weakly Cancellative Fuzzy Logics
Starting from a decomposition result of MTL-chains as ordinal sums, we focus our attention on a particular kind of indecomposable semihoops, namely weakly cancellative semihoops. ...
Franco Montagna, Carles Noguera, Rostislav Horc&ia...