914 search results - page 142 / 183 » The Computational Complexity of Probabilistic Planning |
COCO
2005
Springer
15 years 1 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
122
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
115
click to vote
COCO
1994
Springer
15 years 3 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
CHI
2008
ACM
16 years 6 days ago
2008
ACM
We study the development of common ground in an emergency management planning task. Twelve three-person multi-role teams performed the task with a paper prototype in a controlled ...
CHI
2003
ACM
16 years 5 days ago
2003
ACM
Calendar applications for small handheld devices such as PDAs are growing in popularity. This led us to develop FishCal, a novel calendar interface for PDAs. It supports users in ...