Memory optimizations have became increasingly important in order to fully exploit the computational power of modern GPUs. The data arrangement has a big impact on the performance, and it is very hard for GPU programmers to identify a well-suited data layout. Classical data layout transformations include grouping together data fields that have similar access patterns, or transforming Array-of-St...

People use their mobile devices every day to access a wide variety digital content. The diversity of mobile platforms and that of mobile device capabilities requires providing automatic layout solutions for online content. For the purposes of this paper, our solutions focus on online magazines and newspapers. The ContentDriven Template-Based Layout System (CTLS) is a template-based online magaz...

in this paper, shortest path design problem (spdp) in which the path is incident to all cells is considered. the bi-directional path is one of the known types of configuration of networks for automated guided vehi-cles (agv).to solve this problem, two algorithms are developed. for each algorithm an integer linear pro-gramming (ilp) is determined. the objective functions of both algorithms are t...

In this paper we consider the I-dimensional compaction problem when the layout area contains forbidden regions and the layout components are allowed to move across these regions. Assume we are given a feasible layout containing k forbidden regions and n layout components, where the i-th layout component is a rectilinear polygon consisting of Vi vertical edges, v = L~l Vi· We present an algorith...

Multi-objective layout optimization methods for the conceptual design of robot cellular manufacturing systems are proposed in this paper. Robot cellular manufacturing systems utilize one or more flexible robots which can carry out a large number of operations, and can conduct flexible assemble processes. The layout design stage of such manufacturing systems is especially important since fundame...

We describe new, e cient algorithms for layout modi cation and phase assignment for dark eld alternating-type phase-shifting masks in the single-exposure regime. We make the following contributions. First, we suggest new 2-coloring and compaction approach that simultaneously optimizes layout and phase assignment which is based on planar embedding of an associated con ict graph. We also describe...

The efficiency of desktop publishing is severely limited by the lack of sophisticated automatic document layout systems. State-of-the-art algorithms either require the input to be written in a description language such as HTML and LATEX, or to be a manually designed layout template. However, description languages are ill-suited to express layout problems with weak semantics and layout templates...

Introduction Various attempts have been made to apply evolutionary algorithms (EAs) to complex engineering layout designs. EAs are powerful optimisation techniques inspired by genetics and natural selection while lacking some important characteristics (prior knowledge) that make other classical and numerical search algorithms very effective. Case-based reasoning (CBR) technique is to solve the ...

One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...

Visualisations implemented as virtual worlds can allow users to comprehend large graphs more effectively. Good 3D layout algorithms are an important element. Angle has been developed as a platform for experimenting with 3D force-directed layout algorithms. The big-bang modification is proposed as a means of obtaining efficiently good 3D layouts for a wide range of graphs. Results are presented ...