353 search results - page 27 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
163
Voted
IPCCC
2006
IEEE
15 years 8 months ago
2006
IEEE
We study the routing problem for multi-hop wireless ad hoc networks based on cooperative transmission. We prove that the Minimum Energy Cooperative Path (MECP) routing problem, i....
129
Voted
DATE
2006
IEEE
15 years 6 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...
213
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
138
Voted
IPL
2008
15 years 2 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
131
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...