866 search results - page 90 / 174 » On Dynamic Shortest Paths Problems |
SIGECOM
2003
ACM
14 years 3 months ago
2003
ACM
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
COLOGNETWENTE
2008
13 years 11 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
We study the problem of event detection from realistic videos with repetitive sequential human activities. Despite the large body of work on event detection and recognition, very ...
INFORMATICALT
2006
13 years 10 months ago
2006
In this paper optimization of DSR is achieved using New Link Cache structure and Source Transparent Route Maintenance Method. The new link cache effectively utilizes the memory by ...
JSW
2007
13 years 10 months ago
2007
— Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A clas...