282 search results - page 8 / 57 » Probabilistic Timed Behavior Trees |
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
PRDC
2008
IEEE
14 years 1 months ago
2008
IEEE
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...