552 search results - page 19 / 111 » Lower bounds for dynamic connectivity |
STOC
1997
ACM
15 years 2 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
ICRA
2000
IEEE
15 years 2 months ago
2000
IEEE
W'e consider the kinematic model of a vehicle moving forward with a lower bounded turning radius. This model, is relevant to describe the kinematics of road vehicles as well ...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
ISPD
2004
ACM
15 years 3 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...