An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to mi...
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
A large organization, such as a university, commonly supplies computational power through multiple independently administered computational domains (e.g. clusters). Each computati...
This paper describes TEMPEST, a planner that enables a solar-powered rover to reason about path selection and event placement in terms of available solar energy and anticipated po...
Peer-to-peer sharing systems are becoming increasingly popular and an exciting new class of innovative, internet-based data management systems. In these systems, users contribute ...
Peter Triantafillou, Chryssani Xiruhaki, Manolis K...