Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
—Recently, a new optical device called variable optical delay line (VODL) has been proposed in the literature. As suggested by its name, the delay of a VODL can be dynamically se...
Duan-Shin Lee, Cheng-Shang Chang, Jay Cheng, Horng...
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...