4781 search results - page 473 / 957 » Complexity at large |
205
click to vote
AIPS
2009
15 years 8 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
164
click to vote
ACNS
2010
Springer
15 years 8 months ago
2010
Springer
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
202
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...
207
click to vote
GRIDNETS
2008
15 years 8 months ago
2008
In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interferenc...
191
click to vote
AI
2010
Springer
15 years 7 months ago
2010
Springer
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...