In Robotics, many path-planning algorithms have been proposed but almost all are evaluated only by their path lengths in PC. However, the evaluation is completely independent of a...
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tr...
A market-based scheduling mechanism allocates resources indexed by time to alternative uses based on the bids of participating agents. Agents are typically interested in multiple ...
Michael P. Wellman, Jeffrey K. MacKie-Mason, Danie...
Negotiation is essential in settings where agents have conflicting interests and a desire to cooperate. In many approaches, agents are assumed to have pre-set, fixed preferences...