— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
Luciano C. A. Pimenta, Alexandre R. Fonseca, Guilh...
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
Route flap is an undesirable phenomenon in the Internet and needs to be eliminated for more stable and robust networks. In this paper we present our observations of such persiste...
Yasuhiro Ohara, Manav Bhatia, Osamu Nakamura, Jun ...
Several proof systems allow the formal verification of Java programs, and a specification language was specifically designed for Java. However, none of these systems support generi...