16430 search results - page 253 / 3286 » On Computable Tree Functions |
135
click to vote
IROS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
137
click to vote
INFOCOM
1996
IEEE
15 years 8 months ago
1996
IEEE
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
114
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Self-stabilization is an versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of ...
128
click to vote
EOR
2006
15 years 4 months ago
2006
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
151
click to vote
ECCC
2010
15 years 3 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...