✦ LIBER ✦

A constant time algorithm for theorem proving in propositional logic on reconfigurable meshes

✍ Scribed by B. Pradeep; C. Siva Ram Murthy

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 448 KB
Volume: 85
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(95)00026-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constant-Time Algorithm for the Euclidea

Constant-Time Algorithm for the Euclidean Distance Transform on Reconfigurable Meshes

✍ Amitava Datta; Subbiah Soundaralakshmi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 288 KB

The Euclidean distance transform (EDT) is an operation to convert a binary image consisting of black and white pixels to a representation where each pixel has the Euclidean distance of the nearest black pixel. The EDT has many applications in computer vision and image processing. In this paper, we p

An efficient procedure for theorem provi

An efficient procedure for theorem proving in propositional logic on vector computers

✍ Wen-Tsuen Chen; Ming-Yi Fang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 662 KB

A linear-time algorithm for computing co

A linear-time algorithm for computing collision-free path on reconfigurable mesh

✍ Dajin Wang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 211 KB