Sciweavers

31 search results - page 3 / 7
» Sampled fictitious play for approximate dynamic programming
Sort
View
CGF
2006
126views more  CGF 2006»
14 years 11 months ago
Soft Shadow Maps: Efficient Sampling of Light Source Visibility
Shadows, particularly soft shadows, play an important role in the visual perception of a scene by providing visual cues about the shape and position of objects. Several recent alg...
Lionel Atty, Nicolas Holzschuch, Marc Lapierre, Je...
SPIRE
2005
Springer
15 years 4 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
CSFW
2010
IEEE
15 years 3 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko
IEEEPACT
2000
IEEE
15 years 3 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
ECAI
2010
Springer
15 years 8 days ago
EP for Efficient Stochastic Control with Obstacles
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
Thomas Mensink, Jakob J. Verbeek, Bert Kappen