1060 search results - page 182 / 212 » On the Discovery of Random Trees |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
IROS
2009
IEEE
15 years 4 months ago
2009
IEEE
— Accurate needle insertion in 3D environment is always a grand challenge. When multiple targets are located in the tissue, a procedure of inserting multiple needles from a singl...
IROS
2009
IEEE
15 years 4 months ago
2009
IEEE
— The ability of mobile robots to generate feasible trajectories online is an important requirement for their autonomous operation in unstructured environments. Many path generat...
ACG
2009
Springer
15 years 4 months ago
2009
Springer
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...