Sciweavers

AUTOMATICA
2006
166views more  AUTOMATICA 2006»
13 years 11 months ago
On admissible pairs and equivalent feedback - Youla parameterization in iterative learning control
This paper revisits a well-known synthesis problem in iterative learning control, where the objective is to optimize a performance criterion over a class of causal iterations. The...
Mark Verwoerd, Gjerrit Meinsma, Theo de Vries
DAM
2008
84views more  DAM 2008»
13 years 11 months ago
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
Zoltán Szigeti