159 search results - page 23 / 32 » Computational Complexity of Fundamental Problems in Social C... |
ICCV
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
109
click to vote
SIGECOM
2005
ACM
15 years 5 months ago
2005
ACM
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
109
click to vote
SOFSEM
1999
Springer
15 years 4 months ago
1999
Springer
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
— Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a cost effe...