Sciweavers

510 search results - page 45 / 102
» Complexity measures and decision tree complexity: a survey
Sort
View
OPODIS
2001
15 years 7 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
AAMAS
2012
Springer
14 years 1 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
WG
2005
Springer
15 years 11 months ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...
IHI
2012
249views Healthcare» more  IHI 2012»
14 years 1 months ago
An intelligent web-based decision support tool for enhancing asthma guideline adherence
Asthma is a leading chronic disease of children and currently affects about 6.2 million (8.5%) children in the United States. National Asthma Education and Prevention Program (NAE...
Jinbo Bi, Arun Abraham
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
15 years 7 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens