866 search results - page 75 / 174 » On Dynamic Shortest Paths Problems |
DSN
2009
IEEE
14 years 2 months ago
2009
IEEE
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
JDA
2010
13 years 2 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
INFOCOM
1997
IEEE
13 years 12 months ago
1997
IEEE
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
MICCAI
2009
Springer
14 years 9 months ago
2009
Springer
We develop an algorithm for brain connectivity assessment using geodesics in HARDI (high angular resolution diusion imaging). We propose to recast the problem of nding bers bundles...
COMCOM
2006
13 years 7 months ago
2006
Managing the bandwidth allocated to a Label Switched Path in MPLS networks plays a major role for provisioning of Quality of Service and efficient use of resources. In doing so, t...