1594 search results - page 230 / 319 » An Algorithm to Compute Collusion Paths |
170
click to vote
CCCG
2009
15 years 7 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
134
click to vote
ENDM
2008
15 years 6 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
161
click to vote
EOR
2007
15 years 6 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
148
click to vote
DAM
1999
15 years 5 months ago
1999
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in t...
135
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Bearings-only localization with light-of-sight (LOS) propagation is well understood. This paper concentrates on bearing-only localization with non-line-of-sight (NLOS) measurement...