Sciweavers

1145 search results - page 180 / 229
» Discrete Green's Functions
Sort
View

Publication
222views
14 years 7 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
ICCD
2004
IEEE
128views Hardware» more  ICCD 2004»
14 years 7 months ago
Static Transition Probability Analysis Under Uncertainty
Deterministic gate delay models have been widely used to find the transition probabilities at the nodes of a circuit for calculating the power dissipation. However, with progress...
Siddharth Garg, Siddharth Tata, Ravishankar Arunac...
ICPR
2010
IEEE
14 years 5 months ago
Continuous Markov Random Field Optimization using Fusion Move Driven Markov Chain Monte Carlo Technique
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
Wonsik Kim (Seoul National University), Kyoung Mu ...
EVOW
2010
Springer
14 years 5 months ago
Learning to Dance through Interactive Evolution
A relatively rare application of artificial intelligence at the nexus of art and music is dance. The impulse shared by all humans to express ourselves through dance represents a u...
Greg A. Dubbin, Kenneth O. Stanley
SIBGRAPI
2009
IEEE
14 years 4 months ago
Scale-Space for Union of 3D Balls
Shape discretization through union of weighted points or balls appears as a common representation in different fields of computer graphics and geometric modeling. Among others, it...
Alex Laier Bordignon, Betina Vath, Thales Vieira, ...