In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
Abstract—Awerbuch and Scheideler have shown that peerto-peer overlays networks can survive Byzantine attacks only if malicious nodes are not able to predict what will be the topo...
Emmanuelle Anceaume, Francisco V. Brasileiro, Roma...
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Sampling functions in Gaussian process (GP) models is challenging because of the highly correlated posterior distribution. We describe an efficient Markov chain Monte Carlo algori...
Michalis Titsias, Neil D. Lawrence, Magnus Rattray
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...