We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
NASA increasingly relies on autonomous systems concepts, not only in the mission control centers on the ground, but also on spacecraft, on rovers and other assets on extraterrestr...
Christopher Rouff, Michael G. Hinchey, James L. Ra...
By federating resources from multiple domains, a shared infrastructure provides aggregated computation resources to a large number of users. With rapid advances in virtualization ...
Dongyan Xu, Paul Ruth, Junghwan Rhee, Rick Kennell...
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
In this paper, we consider the problem of mitigating interference and improving network capacity in wireless mesh networks from the angle of temporal-spatial diversity. In a nutsh...