118 search results - page 13 / 24 » The Shortest Path Problem Under Partial Monitoring |
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry sensors. The agents move unpredictably and may ...
ICASSP
2011
IEEE
13 years 5 days ago
2011
IEEE
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...
EMMCVPR
2003
Springer
14 years 1 months ago
2003
Springer
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
ALGORITHMICA
2005
13 years 8 months ago
2005
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
ICCD
1995
IEEE
14 years 7 hour ago
1995
IEEE
Many design techniques have been proposed to optimize the performance of a digital system implemented in a given technology. Each of these techniques can be advantageous in partic...