1662 search results - page 177 / 333 » The Computational Complexity of Agent Design Problems |
139
click to vote
AAAI
2006
15 years 5 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
136
click to vote
AAAI
2011
14 years 4 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
118
Voted
AAAI
2008
15 years 6 months ago
2008
Proactive assessment of computer-network vulnerability to unknown future attacks is an important but unsolved computer security problem where AI techniques have significant impact...
134
Voted
ESAW
2000
Springer
15 years 7 months ago
2000
Springer
Social Order becomes a major problem in MAS and in computer mediated human interaction. After explaining the notions of Social Order and Social Control, I claim that there are mult...
132
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...