Sciweavers

291 search results - page 21 / 59
» Implementation with a bounded action space
Sort
View
CSFW
2007
IEEE
14 years 1 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
WSCG
2001
124views more  WSCG 2001»
13 years 9 months ago
Occlusion Evaluation in Hierarchical Radiosity
In any hierarchical radiosity method, the most expensive part is the evaluation of the visibility. Many methods use sampling and ray casting to determine this term. Space partitio...
Yann Dupuy, Mathias Paulin, René Caubet
ICANNGA
2007
Springer
105views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Reinforcement Learning in Fine Time Discretization
Reinforcement Learning (RL) is analyzed here as a tool for control system optimization. State and action spaces are assumed to be continuous. Time is assumed to be discrete, yet th...
Pawel Wawrzynski
WSCG
2003
138views more  WSCG 2003»
13 years 9 months ago
The Virtual Environment - Another Approach
In this paper the virtual environment, viewed as a multi-dimensional space, populated by entities which interact with each other is considered. In this universe an entity can trig...
Dorin Mircea Popovici, Luca-Dan Serbanati, Fabrice...
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 7 months ago
Johnson-Lindenstrauss lemma for circulant matrices
We prove a variant of a Johnson-Lindenstrauss lemma for matrices with circulant structure. This approach allows to minimise the randomness used, is easy to implement and provides ...
Aicke Hinrichs, Jan Vybíral