Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
—We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unqua...
Angelia Nedic, Alexander Olshevsky, Asuman E. Ozda...
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...