This paper focuses on computer-based generative methods for layout problems in architecture and urban planning with special regard for the hierarchical structuring of layout elements. The generation of layouts takes place using evolutionary algorithms, which are used to optimize the arrangement of elements in terms of overlapping within a given boundary and the topological relations between the...

<span lang="EN-US">A novel metaheuristic optimization algorithm based on cuckoo search (CSA) is presented to solve the construction site layout planning problem (CSLP). CSLP a complex with various applications, such as plant layout, and computer chip layout. Many researchers have investigated by applying many algorithms in an exact or heuristic approach. Although both methods yield promis...

The paper investigates the layout optimisation problem for processor-array networks. If an appropriate shape geometry is selected for the processors, a specific interconnection network can be area-eficiently mapped on a VLSI/WSI chip to maximise the chip yield, operational reliability and circuit performance. A formal technique of cellular layout by polyomino tiles is proposed, with application...

We consider the problem of laying out a tree with fixed parent/child structure in hierarchical memory. The goal is to minimize the expected number of block transfers performed during a search along a root-to-leaf path, subject to a given probability distribution on the leaves. This problem was previously considered by Gil and Itai, who developed optimal algorithms when the block-transfer size i...

Micromachining techniques are being increasingly used to develop miniaturized sensor and actuator systems. These system designs tend to be captured as layout, requiring extraction of the equivalent microelectromechanical circuit as a necessary step for design verification. This paper presents an extraction methodology to (re-)construct a circuit schematic representation from the layout, enablin...

This paper introduces a novel Active Document Versioning system that can extract the layout template and constraints from the original document and then automatically adjust the layout to accommodate new contents. “Active” reflects several unique features of the system: First, the need of handcrafting adjustable templates is largely eliminated through layout understanding techniques that can co...

Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack layout of a dag is similar to a stack layout of an undirected graph, with the additional requirement...

We consider the problem of laying out a tree with xed parent/child structure in hierarchical memory. The goal is to minimize the expected number of block transfers performed during a search along a root-to-leaf path, subject to a given probability distribution on the leaves. This problem was previously considered by Gil and Itai, who developed optimal algorithms when the block-transfer size B i...

Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and species trees or when studying the co-speciation of hosts and parasites. The tanglegram layout problem seeks to produce a layout of the two trees that minimizes the number of crossings between the inter-tree edges. T...

Research on the integrated NC conceptual layout design (I-NCC) concerned with a broader area of interests. The key issues of I-NCC system are associated with NURBS and agent. Firstly, formulas for the derivatives and normal vectors of non-rational B-spline and NURBS are proved based on de BOOR’s recursive formula. Compared with the existing approaches targeting at the non-rational B-spline basi...