2304 search results - page 382 / 461 » On the Vulnerability of Large Graphs |
155
click to vote
IPSN
2003
Springer
15 years 11 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...
161
click to vote
AINA
2010
IEEE
15 years 11 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...
146
Voted
DSN
2002
IEEE
15 years 10 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...
138
Voted
ICDCS
2002
IEEE
15 years 10 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 ...
167
Voted
SIGMOD
2010
ACM
15 years 10 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...