1610 search results - page 196 / 322 » A Transaction Model for Mobile Computing |
164
click to vote
ADHOCNOW
2004
Springer
15 years 9 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
142
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
165
click to vote
AINA
2005
IEEE
15 years 9 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
169
click to vote
AROBOTS
2007
15 years 3 months ago
2007
— A central goal of robotics and AI is to be able to deploy an agent to act autonomously in the real world over an extended period of time. To operate in the real world, autonomo...
162
click to vote
ISPAN
2005
IEEE
15 years 9 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...