𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays

✍ Scribed by K. Kalpakis; Y. Yesha

Publisher
Springer
Year
1999
Tongue
English
Weight
322 KB
Volume
23
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On computing upper and lower bounds on t
On computing upper and lower bounds on the outputs of linear elasticity problems approximated by the smoothed finite element method
✍ Z. C. Xuan; T. Lassila; G. Rozza; A. Quarteroni πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 268 KB πŸ‘ 1 views

## Abstract Verification of the computation of local quantities of interest, e.g. the displacements at a point, the stresses in a local area and the stress intensity factors at crack tips, plays an important role in improving the structural design for safety. In this paper, the smoothed finite elem