Sciweavers

1662 search results - page 183 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ATAL
2008
Springer
13 years 11 months ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm
PODC
2011
ACM
12 years 11 months ago
On the power of hardware transactional memory to simplify memory management
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev,...
3DPVT
2002
IEEE
109views Visualization» more  3DPVT 2002»
14 years 1 months ago
A Hierarchy of Cameras for 3D Photography
We investigate the relationship between camera design and 3D photography, by examining the influence of camera design on the estimation of the motion and structure of a scene fro...
Jan Neumann, Cornelia Fermüller, Yiannis Aloi...
NCA
2009
IEEE
14 years 3 months ago
A Distributed Algorithm for Web Content Replication
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
Sharrukh Zaman, Daniel Grosu
JAIR
2000
152views more  JAIR 2000»
13 years 8 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht