Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences. In this paper we concentrat...
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...
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...