64 search results - page 5 / 13 » Probability-based approach to rectilinear Steiner tree probl... |
GLVLSI
2000
IEEE
13 years 11 months ago
2000
IEEE
Circuit interconnect has become a substantial obstacle in the design of high performance systems. In this paper we explore a new routing paradigm that strikes at the root of the i...
TCBB
2010
13 years 5 months ago
2010
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
GLVLSI
2003
IEEE
13 years 12 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
RECOMB
2012
Springer
11 years 9 months ago
2012
Springer
Signaling networks are essential for cells to control processes such as growth and response to stimuli. Although many “omic” data sources are available to probe signaling pathw...
ASPDAC
2006
ACM
14 years 20 days ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...