• No results found

Trees and networks

Trees and networks before and after Darwin

Trees and networks before and after Darwin

... abstract trees of relationship in his 1837 notebook, and depicted a tree in the Origin of Species ...Darwin's trees in historical ...Other trees were presented by Augier in 1801 and by Lamarck in ...

38

The number of spanning trees in Apollonian networks

The number of spanning trees in Apollonian networks

... ning trees in Apollonian ...the networks, including perco- lation, epidemic spreading, synchronization, and random ...lonian networks constitute an interesting family of maximal planar graphs which ...

15

Optimized query routing trees for wireless sensor networks

Optimized query routing trees for wireless sensor networks

... living trees or other large ...Such networks have already been deployed by the United States Department of Agriculture (USDA) at five different sites ...These networks complement the USDA Forest ...

54

A New Approach to Construct Multicast Trees in MPLS Networks

A New Approach to Construct Multicast Trees in MPLS Networks

... Tel: +33 2 9984 2537, Fax: +33 2 9984 2529 {Aboudani, Bcousin}@Irisa.fr Abstract. In this paper 1 , we present a new approach to construct multi- cast trees in MPLS networks. This approach utilizes MPLS ...

13

Neural networks vs. decision trees for intrusion detection

Neural networks vs. decision trees for intrusion detection

... neural networks are very interesting for generalization and very poor for new attacks attack detection, the decision trees have proven their efficiency in both generalization and new attacks ...

8

Fast algorithm for the reconciliation of gene trees and LGT networks

Fast algorithm for the reconciliation of gene trees and LGT networks

... netic trees; the most commonly used are the DL model, accounting for duplica- tions and losses in gene evolution and yielding polynomially-solvable problems, and the DTL model, which also accounts for gene ...

24

Payment Trees: Low Collateral Payments for Payment Channel Networks

Payment Trees: Low Collateral Payments for Payment Channel Networks

... Payment Trees: Low Collateral Payments for Payment Channel.. Networks.[r] ...

71

Dense edge disjoint embedding of complete binary trees in interconnection networks

Dense edge disjoint embedding of complete binary trees in interconnection networks

... binary trees with n leaves in hypercubes, de Bruijn graphs, doubly-connected two-dimensional meshes and shue-exchange graphs, each with n ...interconnection networks and which we individually recall in the ...

19

Taps vs. SPAN The Forest AND the Trees: Full Visibility into Today's Networks

Taps vs. SPAN The Forest AND the Trees: Full Visibility into Today's Networks

... running networks in the modern world, you can't miss the forest or the trees: both a long view and a close view are necessary to keep networks optimally ...

10

A Study of phylogenetic trees versus networks to objectively identify haplogroups in mitochondrial dna

A Study of phylogenetic trees versus networks to objectively identify haplogroups in mitochondrial dna

... phylogenetic networks are a better option over phylogenetic trees because they can allow for more complex ...phylogenetic trees do not allow for parent nodes to still exist in population like ...

90

Identification of radon anomalies in soil gas using decision trees and neural networks

Identification of radon anomalies in soil gas using decision trees and neural networks

... decision trees and (ii) neural networks, with the aim at identifying radon anomalies caused by seismic events and not simply ascribed to the effect of the environmental ...neural networks, 10 radon ...

5

Counting the number of spanning trees in a class of double fixed-step loop networks

Counting the number of spanning trees in a class of double fixed-step loop networks

... of networks arises in the fields of design and analysis of local area networks, multi-module memory organizations and supercomputer architectures ...spanning trees, diameter, average distance, ...

8

Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs

Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs

... these networks, but the tempo- ral variations in the topology of dynamic networks are not effectively captured in a classical graph ...such networks, in order to compute mul- ticast trees with ...

7

Reliability analysis of dynamic systems by translating temporal fault trees into Bayesian networks

Reliability analysis of dynamic systems by translating temporal fault trees into Bayesian networks

... Bayesian Networks (BNs) have previously been used in the analysis of combina- torial fault trees, ...fault trees from systems models, ...fault trees, and thus enable us to perform quantitative ...

14

Extracting Decision Trees from Diagnostic Bayesian Networks to Guide Test Selection

Extracting Decision Trees from Diagnostic Bayesian Networks to Guide Test Selection

... decision trees from diag- nostic Bayesian nets, including an approach based on the dependency structure of the network ...these trees, tests are recommended for setting evidence within the diagnostic ...

12

Height prediction of tectona grandis trees by mixed effects modelling and artificial neural networks

Height prediction of tectona grandis trees by mixed effects modelling and artificial neural networks

... the trees height, including the effect of tree, stand and environmental variables, is the use of generic mixed effects models or artificial neural ...neural networks in the prediction of tree height was ...

7

Decision Trees and Networks

Decision Trees and Networks

... Traverse the tree in a depth-first manner: a Assign a value to each leaf node based on the outcome, then back-up outcome values b Calculate the average utility at each chance node based [r] ...

11

Efficient Algorithms for Trees and Networks in Evolutionary Genomics

Efficient Algorithms for Trees and Networks in Evolutionary Genomics

... from recombining haplotypes. We demonstrate that our approach is more efficient than ARG- weaver, currently the best recombination genealogy inference approach. Despite the heuristic nature of our method, we show that ...

81

FAUNET: A program package for evalution of fault trees and networks

FAUNET: A program package for evalution of fault trees and networks

... CUTOUT is the final program that scans the result file and calculates the number of minimal sets of any order for the factorized tree, as well as the number of minimal sets for the ori[r] ...

52

Building Alternate Multicasting Trees in MPLS Networks

Building Alternate Multicasting Trees in MPLS Networks

... In Experiment I, we mainly concerned the value of K's effect on the whole network optimization; in Experiment II, performance of the algorithm is evaluated when LSPs have co[r] ...

11

Show all 10000 documents...

Related subjects