335 search results - page 38 / 67 » How to Use Spanning Trees to Navigate in Graphs |
186
click to vote
DISOPT
2010
15 years 6 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
147
click to vote
TROB
2008
15 years 6 months ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
169
click to vote
FSTTCS
2007
Springer
16 years 10 days ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
148
click to vote
ICAS
2006
IEEE
16 years 6 days ago
2006
IEEE
— The development of applications that target dynamic networks often adresses the same difficulties. Since the underlying network topology is unstable, the application has to ha...
193
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...