Sciweavers

118 search results - page 2 / 24
» Using Local Trajectory Optimizers to Speed Up Global Optimiz...
Sort
View
CORR
2007
Springer
89views Education» more  CORR 2007»
13 years 4 months ago
Speeding up Simplification of Polygonal Curves using Nested Approximations
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
Pierre-Francois Marteau, Gildas Ménier
ICPR
2002
IEEE
14 years 6 months ago
Trajectory Segmentation Using Dynamic Programming
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
Richard Mann, Allan D. Jepson, Thomas F. El-Maragh...
IROS
2009
IEEE
143views Robotics» more  IROS 2009»
13 years 11 months ago
Standing balance control using a trajectory library
— This paper presents a standing balance controller. We employ a library of optimal trajectories and the neighboring optimal control method to generate local approximations to th...
Chenggang Liu, Christopher G. Atkeson
ASPDAC
2005
ACM
104views Hardware» more  ASPDAC 2005»
13 years 7 months ago
Speed and voltage selection for GALS systems based on voltage/frequency islands
Due to increasing clock speeds and shrinking technologies, distributing a single global clock signal throughout a chip is becoming a difficult and challenging proposition. In this...
Koushik Niyogi, Diana Marculescu
GCC
2007
Springer
13 years 11 months ago
Dynamic Data Replication based on Local Optimization Principle in Data Grid
Efficient data access is one way of improving the performance of the Data Grid. In order to speed up the data access and reduce bandwidth consumption, Data Grid replicates essenti...
Yulai Yuan, Yongwei Wu, Guangwen Yang, Feng Yu