d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Access to relative location of nearby vehicles on the local roads or on the freeways is useful for providing critical alerts to the drivers, thereby enhancing their driving experi...
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...