Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

95

AUTOMATICA
2000

57views more AUTOMATICA 2000»

A fast algorithm for the computation of an upper bound on the µ-norm

15 years 2 months ago

A fast algorithm for the computation of an upper bound on the µ-norm

Download www.isr.umd.edu

Craig T. Lawrence, André L. Tits, Paul Van

Real-time Traffic

AUTOMATICA 2000 |

claim paper

Related Content

» A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets

» A Probabilistic Upper Bound on Differential Entropy

» Fast parallel circuits for the quantum Fourier transform

» Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm

» Upper Bounds on the Computational Power of an Optical Model of Computation

» Optimizing Computing Costs Using Divisible Load Analysis

» Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning

» Bounded realtime dynamic programming RTDP with monotone upper bounds and performance guara...

» Fast normal vector compression with bounded error

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	AUTOMATICA
Authors	Craig T. Lawrence, André L. Tits, Paul Van Dooren

Comments (0)