✦ LIBER ✦

A manifold imbedding algorithm for optimization problems

✍ Scribed by Y. Hontoir; J.B. Cruz Jr.

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 683 KB
Volume: 8
Category: Article
ISSN: 0005-1098
DOI: 10.1016/0005-1098(72)90029-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A local algorithm for integer optimizati

A local algorithm for integer optimization problems

✍ O.A. Shcherbina 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 262 KB

A distributed algorithm for convex netwo

A distributed algorithm for convex network optimization problems

✍ Stavros A Zenios; John M Mulvey 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 873 KB

Particle swarm optimization algorithm fo

Particle swarm optimization algorithm for constrained problems

✍ Jian-Ming Zhang; Lei Xie 📂 Article 📅 2009 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 104 KB 👁 1 views

A fast algorithm for a redundancy optimi

A fast algorithm for a redundancy optimization problem

✍ V.Dakshina Murty; K.B. Misra 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Tangential-projection algorithm for mani

Tangential-projection algorithm for manifold representation in unidentifiable model updating problems

✍ Lambros S. Katafygiotis; Heung-Fai Lam 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

Optimal Parallel Algorithms for Quadtree

Optimal Parallel Algorithms for Quadtree Problems

✍ S. Kasif 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 449 KB

In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in \(O(\log\) \(N\) ) time using \(N / \log N\) processors on a shared memory model of computation that allows conc