A genetic algorithm for the physical design of VLSI chips is presented The algorithm simultane ously optimizes the placement of the cells with the total routing During the placement the detailed routing is done while the global routes are opti mized by the genetic algorithm This is just opposed to the usual serial ap proach where the computation of the detailed routing is the last step in the l...

The well-known radial graph layout technique has plenty of advantages for graph visualization and graph exploration, but is quite limited in the size of graphs it can display effectively because the layout is inherently global and allows far away or out of view nodes to distort the focus region. The primary contribution of this project is to introduce sub tree clustering to allow the layout alg...

Metal price is one of the most important parameters in the calculation of cut- off grade. The cut- off grade has the main role in determination of mine layout. Mine layout actuates mineable reserve, mine life and economic profitability. Not considering the uncertainty in metal prices can lead to a non-optimal layout. In this paper optimum underground mine layout is determined by expected utilit...

The subject matter of this article is the conversion post-industrial architecture for residential usage. Lofts (or loft apartments) are typical such conversions. Definitions type architectural building determine their specificity. aim research was to answer question Do modern-day adaptations buildings usage in Poland meet criteria definition lofts? first section introduces origins and evolution...

We develop a procedure for the design of distributed layouts in a multiple period setting, where product demand and product mix may vary from period to period. We allow for multiple copies of the same department type to be placed in non-adjoining locations and for flow allocation among department duplicates to be made based on the demand for each period. We also allow for the possibility of a r...

We propose a two-phase heuristic for crossing reduction in circular layouts. While the first algorithm uses a greedy policy to build a good initial layout, an adaptation of the sifting heuristic for crossing reduction in layered layouts is used for local optimization in the second phase. Both phases are conceptually simpler than previous heuristics, and our extensive experimental results indica...