A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The paper studies the expectation of the inspection time in complex aging systems, i.e. the length of the shortest path in a Directed Acyclic Graph, with random costs on egdes. We give a lower bound for this expectation.doi:10.1016/j.spl.2016.06.001 fatcat:4c4o5p4llbb6negxoqjoo3snfi