✦ LIBER ✦

Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights

✍ Scribed by Li-Pu Yeh; Biing-Feng Wang; Hsin-Hao Su

Publisher: Springer
Year: 2009
Tongue: English
Weight: 651 KB
Volume: 56
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-009-9284-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient and reliable accelerated const

Efficient and reliable accelerated constant stiffness algorithms for the solution of non-linear problems

✍ Chang-New Chen 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 502 KB

An efficient algorithm for solving the i

An efficient algorithm for solving the inverse problem of element analysis by X-ray spectroscopy

✍ P. N. Zaikin; T. V. Kirisova; T. A. Pron'ko 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 345 KB

An efficient time/frequency domain algor

An efficient time/frequency domain algorithm for modal analysis of non-linear models discretized by the FEM

✍ D. Soares Jr.; W.J. Mansur 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 305 KB

The present paper describes an efficient time/frequency domain approach for modal analysis of non-linear models discretized by the FEM. An efficient recurrence relationship for displacement and velocity, based on the GreenÕs function of the model and its time derivative, is presented in both a time

A note on the article “An improved versi

A note on the article “An improved version of Wang's algorithm for two-dimensional cutting problems” written by J.F. Oliveira and J.S. Ferreira, Volume 44, 1990, pp. 256–266

✍ Oliver Holthaus 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 204 KB