Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Area minimization for hierarchical floorplans (1996)
    Springer
    Algorithmica 15 (1996), S. 550-571 
    Details
    ISSN: 1432-0541
    Keywords: Design automation ; VLSI layout ; Floorplanning ; Floorplan sizing ; Area minimization ; NP-complete ; Hierarchical floorplans ; Pseudopolynomial
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we study the area-minimization problem for hierarchical floorplans. We settle an open problem on the complexity of the area-minimization problem for hierarchical floorplans by showing it to be NP-complete (even for balanced hierarchical floorplans). We then present a new algorithm for determining the nonredundant realizations of a wheel. The algorithm has time costO(k 2 logk) and space cost0(k 2) if each block in a wheel has at mostk realizations. Based on the new algorithm for a wheel, we design a new pseudopolynomial area-minimization algorithm for hierarchical floorplans of order-5. The time and space costs of the algorithm are0((nM)2log(nM) and0(n 2 M), respectively, wheren is the number of basic blocks andM is an upper bound on the dimensions of the realizations of the basic blocks. The area-minimization algorithm was implemented. Experimental results show that it is very fast.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01940881
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Two new characteristic parameters for runoff computation (1992)
    Springer
    Water resources management 6 (1992), S. 165-184 
    Details
    ISSN: 1573-1650
    Keywords: Catchment runoff ; kinematic wave equation ; hydrograph computation ; runoff computation ; surface runoff ; overland flow
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract A method capable of estimating the hydrograph from a prescribed storm for a practical mild slope upstream catchment is proposed. This method makes use of two new characteristic parameters, τ andS, in conjunction with the kinematic wave equation to compute lateral inflows of the main stream of the catchment. The depth profile of overland flow at any instant within the catchment and hydrograph at any location can be easily found. Lag times for individual lateral inflows are then considered and are linearly combined to obtain the hydrograph at the outlet of the catchment or depth profile of the main stream at any instant. The validity of the excess rainfall-surface runoff linear relationship in this study has also been verified with Tatsunokuchiyama catchment, and it shows good results for this computed runoff.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00872354
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...