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...
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
The consistency of classification algorithm plays a central role in statistical learning theory. A consistent algorithm guarantees us that taking more samples essentially suffices...
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
—Previous work demonstrated that the improvements in spectral efficiency and link reliability can be obtained in wireless relay networks employing terminals with MIMO capability...