390 search results - page 40 / 78 » Computing shortest paths for any number of hops |
106
click to vote
ICRA
2009
IEEE
15 years 8 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
110
click to vote
MSN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
119
click to vote
DATE
2006
IEEE
15 years 5 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
129
click to vote
NETGAMES
2006
ACM
15 years 8 months ago
2006
ACM
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
105
click to vote
NETWORKING
2004
15 years 3 months ago
2004
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...