Sciweavers

1923 search results - page 164 / 385
» Weighted Decision Trees
Sort
View
ISAAC
2007
Springer
70views Algorithms» more  ISAAC 2007»
16 years 16 days ago
Kinetic Maintenance of Mobile k-Centres on Trees
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
Stephane Durocher, Christophe Paul
ICTAI
2006
IEEE
16 years 13 days ago
A Junction Tree Propagation Algorithm for Bayesian Networks with Second-Order Uncertainties
Bayesian networks (BNs) have been widely used as a model for knowledge representation and probabilistic inferences. However, the single probability representation of conditional d...
Maurizio Borsotto, Weihong Zhang, Emir Kapanci, Av...
ISAAC
2005
Springer
89views Algorithms» more  ISAAC 2005»
15 years 12 months ago
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Le...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 8 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
GECCO
2004
Springer
15 years 11 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby