Sciweavers

865 search results - page 64 / 173
» Uncertainty Reduction Using Dynamics
Sort
View
NETWORKS
2008
15 years 2 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
AUTOMATICA
2007
145views more  AUTOMATICA 2007»
15 years 2 months ago
Decentralized adaptive output-feedback stabilization for large-scale stochastic nonlinear systems
In this paper, the problem of decentralized adaptive output-feedback stabilization is investigated for large-scale stochastic nonlinear systems with three types of uncertainties, ...
Shu-Jun Liu, Ji-Feng Zhang, Zhong-Ping Jiang
JCO
2002
96views more  JCO 2002»
15 years 2 months ago
On the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
Jian Yang, Gang Yu
TCAD
2008
136views more  TCAD 2008»
15 years 2 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
15 years 5 months ago
3D bipedal walking with knees and feet: A hybrid geometric approach
Abstract— Motivated by the goal of obtaining moreanthropomorphic walking in bipedal robots, this paper considers a hybrid model of a 3D hipped biped with feet and locking knees. ...
Ryan W. Sinnet, Aaron D. Ames