On the complexity of resilient network design
✍ Scribed by Artur Tomaszewski; Michał Pióro; Mateusz Żotkiewicz
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 354 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we improve the bounds for computing a network decomposition Ž ⑀ Ž n. ⑀ Ž n. . distributively and deterministically. Our algorithm computes an n , n - ## Ž . decomposition in n time, where ⑀ n s 1r log n . As a corollary we obtain ' improved deterministic bounds for distributively c
A research program directed at the development of an autolander for NASA's X-33 prototype reusable launch vehicle is described. The autolander is based on a new linear quadratic adaptive critic algorithm. It is implemented by an array of Functional Link neural networks and is trained by a modi"ed Le