Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Abstract. Important attributes of 3D brain segmentation algorithms include robustness, accuracy, computational efficiency, and facilitation of user interaction, yet few algorithms ...
Abstract. Designers of large parallel computers and clusters are becoming increasingly concerned with the cost and power consumption of the interconnection network. A simple way to...
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...