This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...
Previous studies of Object-Oriented (OO) software have reported avoidance of the inheritance mechanism and cast doubt on the wisdom of ‘deep’ inheritance levels. From an evolu...
— In this paper we design coordination policies for a routing problem requiring human-assisted classification of targets through analysis of information gathered on-site by auto...
The directional contact range of two convex polyhedra is the range of positions that one of the polyhedron may locate along a given straight line so that the two polyhedra are in c...
—In mobile ad hoc networks, solving the standard problems encountered in fixed networks can be challenging because of the unpredictable motion of mobile nodes. Due to the lack o...