Sciweavers

393 search results - page 73 / 79
» Convex Programming Methods for Global Optimization
Sort
View
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
14 years 13 days ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
CAD
2011
Springer
12 years 11 months ago
Industrial design using interpolatory discrete developable surfaces
Design using free-form developable surfaces plays an important role in manufacturing industry. Currently most commercial systems can only support converting free-form surfaces int...
Yong-Jin Liu, Kai Tang, Wen-Yong Gong, Tie-Ru Wu
IEEEPACT
2008
IEEE
14 years 1 months ago
Multi-optimization power management for chip multiprocessors
The emergence of power as a first-class design constraint has fueled the proposal of a growing number of run-time power optimizations. Many of these optimizations trade-off power...
Ke Meng, Russ Joseph, Robert P. Dick, Li Shang
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
14 years 1 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
ICASSP
2011
IEEE
12 years 11 months ago
Accurate parameter generation using fixed-point arithmetic for embedded HMM-based speech synthesizers
Parameter trajectory generation for HMM-based speech synthesis is practically achieved using only fixed-point arithmetic with 32-bit integers. Since processors for embedded devic...
Nobuyuki Nishizawa, Tsuneo Kato