✦ LIBER ✦

Explicit and implicit algorithms for binate covering problems

✍ Scribed by Villa, T.; Kam, T.; Brayton, R.K.; Sangiovanni-Vincenteili, A.L.

Book ID: 119778203
Publisher: IEEE
Year: 1997
Tongue: English
Weight: 417 KB
Volume: 16
Category: Article
ISSN: 0278-0070
DOI: 10.1109/43.644030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Explicit-implicit computational algorith

Explicit-implicit computational algorithms for multiphase filtration problems

✍ P. N. Vabishchevich 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 162 KB

Implicit and explicit algorithms for sol

Implicit and explicit algorithms for solving the split feasibility problem

✍ Xin Yu, Naseer Shahzad, Yonghong Yao 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 197 KB

Problems and algorithms for covering arr

Problems and algorithms for covering arrays

✍ Alan Hartman; Leonid Raskin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Combined implicit/explicit algorithms fo

Combined implicit/explicit algorithms for crashworthiness analysis

✍ L. Noels; L. Stainier; J.-P. Ponthot 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 641 KB

In order to simulate an industrial process, an explicit method, which is conditionally stable, is the most adapted while the non-linearities evolve rapidly (impact phase, stamping process, etc.). But when the dynamics becomes quasi-linear (post-impact analysis, springback simulation, etc.), an impli

Search pruning techniques in SAT-based b

Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problem

✍ Manquinho, V.M.; Marques-Silva, J.P. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 393 KB

An implicit-explicit domain decompositio

An implicit-explicit domain decomposition algorithm for a singularly perturbed parabolic problem

✍ I. Boglaev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 685 KB