Sciweavers

373 search results - page 18 / 75
» Covariant Policy Search
Sort
View
UAI
2004
13 years 10 months ago
Heuristic Search Value Iteration for POMDPs
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...
Trey Smith, Reid G. Simmons
CCS
2008
ACM
13 years 11 months ago
User-controllable learning of security and privacy policies
Studies have shown that users have great difficulty specifying their security and privacy policies in a variety of application domains. While machine learning techniques have succ...
Patrick Gage Kelley, Paul Hankes Drielsma, Norman ...
WETICE
2003
IEEE
14 years 2 months ago
On Optimal Update Policies and Cluster Sizes for 2-Tier Distributed Systems
We try to analyze a generic model for 2-tier distributed systems, exploring the possibility of optimal cluster sizes from an information management perspective, such that the over...
Prasenjit Dey, Anwitaman Datta
SAT
2009
Springer
103views Hardware» more  SAT 2009»
14 years 1 months ago
Instance-Based Selection of Policies for SAT Solvers
Execution of most of the modern DPLL-based SAT solvers is guided by a number of heuristics. Decisions made during the search process are usually driven by some fixed heuristic pol...
Mladen Nikolic, Filip Maric, Predrag Janicic
UAI
2001
13 years 10 months ago
Policy Improvement for POMDPs Using Normalized Importance Sampling
We present a new method for estimating the expected return of a POMDP from experience. The estimator does not assume any knowledge of the POMDP, can estimate the returns for finit...
Christian R. Shelton