1485 search results - page 14 / 297 » connection 2010 |
AUTOMATICA
2010
13 years 7 months ago
2010
The ability of a robot team to reconfigure itself is useful in many applications: for metamorphic robots to change shape, for swarm motion towards a goal, for biological systems to...
CCCG
2010
13 years 9 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
CN
2010
13 years 5 months ago
2010
This article addresses the ubiquitous topic of Quality of Service (QoS) aware connection provisioning in wavelength routed WDM optical networks. The impact of the connection setup...
ENTCS
2007
13 years 7 months ago
2007
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
DM
2010
13 years 7 months ago
2010
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given ...