Sciweavers

1469 search results - page 170 / 294
» Discretization of a Continuous Curve
Sort
View
NIPS
2007
15 years 6 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens
152
Voted
VMV
2001
108views Visualization» more  VMV 2001»
15 years 6 months ago
A Theoretical Comparison of Monte Carlo Radiosity Algorithms
In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete coll...
Philippe Bekaert, Hans-Peter Seidel
AMC
2007
108views more  AMC 2007»
15 years 4 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
DEDS
2008
94views more  DEDS 2008»
15 years 4 months ago
Approximate Simulation Relations for Hybrid Systems
Abstract Approximate simulation relations have recently been introduced as a powerful tool for the approximation of discrete and continuous systems. In this paper, we his abstracti...
Antoine Girard, A. Agung Julius, George J. Pappas
COGSR
2011
102views more  COGSR 2011»
14 years 11 months ago
Rethinking cognitive architecture via graphical models
Cognitive architectures need to resolve the diversity dilemma – i.e., to blend diversity and simplicity – in order to couple functionality and efficiency with integrability, e...
Paul S. Rosenbloom