2304 search results - page 382 / 461 » On the Vulnerability of Large Graphs |
IPSN
2003
Springer
14 years 4 months ago
2003
Springer
We consider the problem of coverage and exploration of an unknown dynamic environment using a mobile robot(s). The environment is assumed to be large enough such that constant moti...
AINA
2010
IEEE
14 years 3 months ago
2010
IEEE
Abstract—Directed Acyclic Graphs (DAGs), rooted at popular/default destinations, have emerged as a preferred mechanism to provide IPv6 routing functionality in large scale low po...
DSN
2002
IEEE
14 years 3 months ago
2002
IEEE
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...
ICDCS
2002
IEEE
14 years 3 months ago
2002
IEEE
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
SIGMOD
2010
ACM
14 years 3 months ago
2010
ACM
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...