Sciweavers

361 search results - page 31 / 73
» Approximate counting by dynamic programming
Sort
View
CGF
2008
168views more  CGF 2008»
13 years 7 months ago
Interactive Global Illumination for Deformable Geometry in CUDA
Interactive global illumination for fully deformable scenes with dynamic relighting is currently a very elusive goal in the area of realistic rendering. In this work we propose a ...
Arne Schmitz, Markus Tavenrath, Leif Kobbelt
JUCS
2010
142views more  JUCS 2010»
13 years 6 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
FATES
2006
Springer
13 years 11 months ago
Dynamic Architecture Extraction
Abstract. Object models capture key properties of object-oriented architectures, and they can highlight relationships between types, occurrences of sharing, and object encapsulatio...
Cormac Flanagan, Stephen N. Freund
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
14 years 1 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
ATAL
2007
Springer
14 years 1 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone