✦ LIBER ✦

The Branching-Time Transformation Technique for Chain Datalog Programs

✍ Scribed by Panos Rondogiannis; Manolis Gergatsoulis

Book ID: 110313759
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 130 KB
Volume: 17
Category: Article
ISSN: 0925-9902
DOI: 10.1023/a:1012502800961

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Compile-Time Multiprocessor Sche

Optimal Compile-Time Multiprocessor Scheduling Based on the O–1 Linear Programming Algorithm with the Branch and Bound Technique

✍ D.Antony Louis Piriyakumar; C.Siva Ram Murthy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 238 KB

This paper is organized as follows. We describe the formulation of the problem and the required definitions in Section II. In Section III, the performance improvement over [6] due to processor isomorphism and look ahead pruning in reducing the search space is explained, along with a note on the lowe

The transformation technique for a class

The transformation technique for a class of variable upper bounding constraits in linear programming

✍ Edward Y.H. Lin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 83 KB

Parallel imaging technique for the exter

Parallel imaging technique for the external carotid artery and its branches: Comparison of balanced turbo field echo, phase contrast, and time-of-flight sequences

✍ Tadateru Sumi; Misa Sumi; Marc Van Cauteren; Yasuo Kimura; Takashi Nakamura 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB

## Abstract ## Purpose To evaluate the parallel imaging technique in the external carotid artery and its branches using 3D balanced turbo field echo (3D bTFE), 3D phase‐contrast (3D PC), and 3D time‐of‐flight (3D TOF) MR angiography (MRA) sequences. ## Materials and Methods A total of 26 healthy