Sciweavers

461 search results - page 69 / 93
» Practical polynomial factoring in polynomial time
Sort
View
COLT
2008
Springer
13 years 9 months ago
Learning Acyclic Probabilistic Circuits Using Test Paths
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
Dana Angluin, James Aspnes, Jiang Chen, David Eise...
AAAI
2006
13 years 8 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
AIPS
2000
13 years 8 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
JMLR
2006
117views more  JMLR 2006»
13 years 7 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
TDSC
2008
152views more  TDSC 2008»
13 years 7 months ago
Towards Formal Verification of Role-Based Access Control Policies
Specifying and managing access control policies is a challenging problem. We propose to develop formal verification techniques for access control policies to improve the current s...
Somesh Jha, Ninghui Li, Mahesh V. Tripunitara, Qih...