Sciweavers

6693 search results - page 30 / 1339
» On an anytime algorithm for control
Sort
View
UAI
2000
13 years 10 months ago
Value-Directed Belief State Approximation for POMDPs
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
Pascal Poupart, Craig Boutilier
FGCS
1992
107views more  FGCS 1992»
13 years 10 months ago
Logic Programming, Abduction and Probability
Probabilistic Horn abduction is a simple framework to combine probabilistic and logical reasoning into a coherent practical framework. The numbers can be consistently interpreted ...
David Poole
JAIR
2006
102views more  JAIR 2006»
13 years 9 months ago
Multiple-Goal Heuristic Search
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
Dmitry Davidov, Shaul Markovitch
EUROCRYPT
2009
Springer
14 years 9 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
MOBIQUITOUS
2007
IEEE
14 years 3 months ago
Towards Scalable and Robust Service Discovery in Ubiquitous Computing Environments via Multi-hop Clustering
Abstract— Large-scale ubiquitous computing environments require scalable and robust service discovery to enable “anytime, anywhere” computing, which is hard to be satisfied ...
Wei Gao