104 search results - page 6 / 21 » A Greedy Algorithm Estimating the Height of Random Trees |
IROS
2008
IEEE
14 years 3 months ago
2008
IEEE
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
AAAI
2006
13 years 10 months ago
2006
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
ICPADS
2010
IEEE
13 years 6 months ago
2010
IEEE
Online Social Networks (OSNs) are more and more popular recently; people may through them interact with each other for the purpose of social intercourse. The client/server OSN arch...
TPDS
2008
13 years 8 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...