72 search results - page 6 / 15 » Integral trees with given nullity |
COLING
1992
14 years 10 months ago
1992
We describe a method and its implementation for self-monitoring during natural language generation. In situations of communication where the generation of ambiguous utterances sho...
PATMOS
2004
Springer
15 years 2 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
ENTCS
2006
14 years 9 months ago
2006
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
ISPD
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
105
click to vote
TCAD
2008
14 years 9 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...