Sciweavers

2052 search results - page 65 / 411
» Direct Combination
Sort
View
ICML
1995
IEEE
16 years 4 months ago
Residual Algorithms: Reinforcement Learning with Function Approximation
A number of reinforcement learning algorithms have been developed that are guaranteed to converge to the optimal solution when used with lookup tables. It is shown, however, that ...
Leemon C. Baird III
129
Voted
SI3D
2009
ACM
15 years 10 months ago
Approximating dynamic global illumination in image space
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...
Tobias Ritschel, Thorsten Grosch, Hans-Peter Seide...
INFOCOM
2003
IEEE
15 years 8 months ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
TOG
2012
170views Communications» more  TOG 2012»
13 years 5 months ago
Interactive editing of deformable simulations
We present an interactive animation editor for complex deformable object animations. Given an existing animation, the artist directly manipulates the deformable body at any time f...
Jernej Barbic, Funshing Sin, Eitan Grinspun
DSD
2010
IEEE
133views Hardware» more  DSD 2010»
15 years 21 days ago
Area and Speed Oriented Implementations of Asynchronous Logic Operating under Strong Constraints
Asynchronous circuit implementations operating under strong constraints (DIMS, Direct Logic, some of NCL gates, etc.) are attractive due to: 1) regularity; 2) combined implementati...
Igor Lemberski, Petr Fiser