Sciweavers

150 search results - page 3 / 30
» Gradient methods for iterative distributed control synthesis
Sort
View
TON
2010
279views more  TON 2010»
13 years 6 months ago
Distributed algorithms for minimum cost multicast with network coding
— We adopt the network coding approach to achieve minimum-cost multicast in interference-limited wireless networks where link capacities are functions of the signal-to-noise-plus...
Yufang Xi, Edmund M. Yeh
ICRA
2000
IEEE
95views Robotics» more  ICRA 2000»
14 years 2 days ago
A New Redundancy-Based Iterative Scheme for Avoiding Joint Limits Application to Visual Servoing
We propose in this paper new redundancy-based solutions to avoid robot joint limits of a manipulator. We use a control scheme based on the task function approach. We first recall...
François Chaumette, Éric Marchand
CDC
2008
IEEE
127views Control Systems» more  CDC 2008»
14 years 2 months ago
Distributed control: A sequentially semi-separable approach
— We consider the problem of designing controllers for spatially-varying interconnected systems distributed in one spatial dimension. The matrix structure of such systems can be ...
Justin K. Rice, Michel Verhaegen
DAC
2000
ACM
14 years 8 months ago
Practical iterated fill synthesis for CMP uniformity
We propose practical iterated methods for layout density control for CMP uniformity, based on linear programming, Monte-Carlo and greedy algorithms. We experimentally study the tr...
Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexande...
INFOCOM
1995
IEEE
13 years 11 months ago
Complexity of Gradient Projection Method for Optimal Routing in Data Networks
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
Wei Kang Tsai, John K. Antonio, Garng M. Huang