๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A sublinear-time randomized approximation algorithm for matrix games

โœ Scribed by Michael D. Grigoriadis; Leonid G. Khachiyan

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
385 KB
Volume
18
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A majorization algorithm for constrained
A majorization algorithm for constrained correlation matrix approximation
โœ Dan Simon; Jeff Abell ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 295 KB

We desire to find a correlation matrix R of a given rank that is as close as possible to an input matrix R, subject to the constraint that specified elements in R must be zero. Our optimality criterion is the weighted Frobenius norm of the approximation error, and we use a constrained majorization a

APPROXIMATING THE HYSTERETIC DAMPING MAT
APPROXIMATING THE HYSTERETIC DAMPING MATRIX BY A VISCOUS MATRIX FOR MODELLING IN THE TIME DOMAIN
โœ D.J. HENWOOD ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 487 KB

The paper is concerned with modelling the dynamic behaviour of a structure with damping. Hysteretic damping is commonly accepted to be reasonably accurate in some circumstances, but can only be applied directly in the frequency domain. Dynamic (time) behaviour, however, is most conveniently predicte

A new approximation algorithm for obtain
A new approximation algorithm for obtaining the probability distribution function for project completion time
โœ Ming-Jong Yao; Weng-Ming Chu ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 994 KB

This paper focuses on the application of the techniques of discretization to obtain an approximated probability density function (pdf ) for the completion time of large-size projects, in which we allow any type of pdf for the duration of activities. In this study, we improve the techniques of discre