31 search results - page 1 / 7 » Power-Aware Collective Tree Exploration |
ARCS
2006
Springer
13 years 8 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
TMC
2012
11 years 7 months ago
2012
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
EUROPAR
2007
Springer
13 years 11 months ago
2007
Springer
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
VLDB
2002
ACM
14 years 5 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
SECON
2008
IEEE
13 years 11 months ago
2008
IEEE
— What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using real...