1594 search results - page 90 / 319 » An Algorithm to Compute Collusion Paths |
126
click to vote
PERCOM
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...
108
click to vote
APPT
2007
Springer
15 years 9 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
100
click to vote
IJRR
2008
15 years 3 months ago
2008
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximum speeds of the moving ob...
127
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—Detecting the occurrence and location of performance anomalies (e.g., high jitter or loss events) is critical to ensuring the effective operation of network infrastructu...
105
click to vote
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
We have developed a technique to compute a Quasi Static Schedule of a concurrent specification for the software partition of an embedded system. Previous work did not take into a...