Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
Many modern computing environments involve dynamic peer groups. Distributed simulation, multi-user games, conferencing and replicated servers are just a few examples. Given the op...
In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to expres...
The telecommunications environment is changing its face towards an open market of information services where the vision is "information any time, at any place, in any form&qu...
Application scenarios for mobile ad-hoc networks (MANETs) impose a variety of non-standard security requirements. furthermore, in many scenarios owner and user of devices do not a...