Sciweavers

324 search results - page 15 / 65
» What's in a Step
Sort
View
ESANN
2006
13 years 11 months ago
Learning for stochastic dynamic programming
Abstract. We present experimental results about learning function values (i.e. Bellman values) in stochastic dynamic programming (SDP). All results come from openDP (opendp.sourcef...
Sylvain Gelly, Jérémie Mary, Olivier...
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
13 years 9 months ago
Expressive Declassification Policies and Modular Static Enforcement
This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed...
Anindya Banerjee, David A. Naumann, Stan Rosenberg
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
14 years 1 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
AINA
2007
IEEE
14 years 4 months ago
Towards Quantifying the (In)Security of Networked Systems
Traditional security analyses are often geared towards cryptographic primitives or protocols. Although such analyses are absolutely necessary, they do not provide much insight for...
Xiaohu Li, T. Paul Parker, Shouhuai Xu
KR
2004
Springer
14 years 3 months ago
From Hybrid Systems to Universal Plans Via Domain Compilation
While universal plans tell a system how to reach a goal regardless of what state it is in, such plans can be too large to represent. Hybrid systems execute plans where each action...
Anthony Barrett