Sciweavers

194 search results - page 21 / 39
» Approximate dynamic programming: Lessons from the field
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
ICSE
2004
IEEE-ACM
14 years 7 months ago
An Empirical Comparison of Dynamic Impact Analysis Algorithms
Impact analysis -- determining the potential effects of changes on a software system -- plays an important role in software engineering tasks such as maintenance, regression testi...
Alessandro Orso, Taweesup Apiwattanapong, James La...
CAD
2007
Springer
13 years 7 months ago
Direct extraction of surface meshes from implicitly represented heterogeneous volumes
This paper describes a novel algorithm to extract surface meshes directly from implicitly represented heterogeneous models made of different constituent materials. Our approach ca...
Charlie C. L. Wang
MVA
2010
206views Computer Vision» more  MVA 2010»
13 years 2 months ago
Estimating the motion of plant root cells from in vivo confocal laser scanning microscopy images
Images of cellular structures in growing plant roots acquired using confocal laser scanning microscopy (CLSM) have some unusual properties that make motion estimation challenging....
Timothy J. Roberts, Stephen J. McKenna, Cheng-Jin ...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 12 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi