✦ LIBER ✦

Optimal Initializing Algorithms for a Reconfigurable Mesh

✍ Scribed by K. Nakano

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 486 KB
Volume: 24
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1995.1021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Algorithms for Constrained Recon

Optimal Algorithms for Constrained Reconfigurable Meshes

✍ Bryan Beresford-Smith; Oliver Diessel; Hossam ElGindy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 220 KB

model the propagation delay on a bus-unit 1 by a constant, and to only permit the class of algorithms, denoted by A k , which configure bus components bound in size to at most k bus-units to run on the model. We give a detailed description of our reconfigurable mesh model in the following section.

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

A fuzzy-tuned genetic algorithm for opti

A fuzzy-tuned genetic algorithm for optimal reconfigurations of radial distribution network

✍ N. C. Sahoo; R. Ranjan; K. Prasad; A. Chaturvedi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

A reconfigurative algorithm for Torus li

A reconfigurative algorithm for Torus lightwave networks

✍ Manabu Kato; Ryuji Kawakita; Hiroshi Nagamochi; Yuji Oie 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 882 KB

Lightwave networks based on wavelength division multiplex (WDM) technology can modify the logical configuration of a network by reassigning the wavelength of the transmitters and receivers at the nodes. When traffic is deviated, network performance, such as the maximum throughput and the average del

A method for hexahedral mesh shape optim

A method for hexahedral mesh shape optimization

✍ Patrick M. Knupp 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB

A mesh deformation algorithm for free su

A mesh deformation algorithm for free surface problems

✍ Fenton, Gordon A.; Griffiths, D. V. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 1 views

Employing the simple iterative technique of adjusting the element positions using computed potentials to locate the free surface can lead to finite elements with large aspect ratios as the free surface drops towards the base of the mesh. In particular, free surface modelling of earth dams with base