✦ LIBER ✦

An efficient optimization procedure for tetrahedral meshes by chaos search algorithm

✍ Scribed by ShuLi Sun; JianFei Liu

Publisher: Springer
Year: 2003
Tongue: English
Weight: 904 KB
Volume: 18
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02945469

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Epcot: An efficient procedure for colori

Epcot: An efficient procedure for coloring optimally with Tabu Search

✍ N. Dubois; D. de Werra 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 707 KB

We present an exact procedure for coloring the nodes of s graph with as few colors as possible. The problem o~ deciding whether an arbitrary graph can be colored with k colars is NP-complete. The procedure is based ms an implicit enumm'&tion technique. At some stsgrs of the algorithm heuristic metho

Mesh optimization for surface approximat

Mesh optimization for surface approximation using an efficient coarse-to-fine evolutionary algorithm

✍ Hui-Ling Huang; Shinn-Ying Ho 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 901 KB

The investigated mesh optimization problem C(N; n) for surface approximation, which is NP-hard, is to minimize the global error between a digital surface and its approximating mesh surface by e ciently locating a limited number n of grid points which are a subset of the original N sample points. Thi

Amer. inst. chem. eng. j.: Pho, T. K. an

Amer. inst. chem. eng. j.: Pho, T. K. and Lapidus, L. ‘Topics in c.a.d. Part. An optimum tearing algorithm for recycle systems’ Part 2. Synthesis of optimal heat exchanger networks by tree searching algorithms’ Vol 19, No 6 (November 1973) pp 1170–1189

📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 116 KB

The SAR70 program has been written as a tool within the SAR design method for supports. A support is a building in which a variety of floorplans for dwellings can hc made. The design method allows evaluation of such asupport. SAR7O can be used to generate all variations possible within a support str