88 search results - page 7 / 18 » A new approach to dynamic all pairs shortest paths |
106
click to vote
IWQOS
2004
Springer
15 years 5 months ago
2004
Springer
— Traditional SLAs, defined by average delay or packet loss, often camouflage the instantaneous performance perceived by end-users. We define a set of metrics for service avai...
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
BMCBI
2007
14 years 11 months ago
2007
Background: Gas chromatography-mass spectrometry (GC-MS) is a robust platform for the profiling of certain classes of small molecules in biological samples. When multiple samples ...