Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...