Sciweavers

352 search results - page 35 / 71
» On implementation choices for iterative improvement partitio...
Sort
View
ICRA
2010
IEEE
99views Robotics» more  ICRA 2010»
13 years 7 months ago
Retraction-based RRT planner for articulated models
— We present a new retraction algorithm for high DOF articulated models and use our algorithm to improve the performance of RRT planners in narrow passages. The retraction step i...
Jia Pan, Liangjun Zhang, Dinesh Manocha
IPPS
1997
IEEE
14 years 1 months ago
Time-Stamping Algorithms for Parallelization of Loops at Run-Time
In this paper, we present two new run-time algorithms for the parallelization of loops that have indirect access patterns. The algorithms can handle any type of loop-carried depen...
Cheng-Zhong Xu, Vipin Chaudhary
ATAL
2005
Springer
14 years 2 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
ISPD
1997
ACM
68views Hardware» more  ISPD 1997»
14 years 1 months ago
Faster minimization of linear wirelength for global placement
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 7 months ago
Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
Sarah Filippi, Olivier Cappé, Aurelien Gari...