599 search results - page 61 / 120 » The repeater tree construction problem |
130
click to vote
ICCAD
1995
IEEE
15 years 8 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
162
click to vote
CCIA
2005
Springer
15 years 6 months ago
2005
Springer
This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The pr...
172
click to vote
WSS
2001
15 years 5 months ago
2001
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...
149
click to vote
ISAAC
2003
Springer
15 years 9 months ago
2003
Springer
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
144
click to vote
ACL
2010
15 years 2 months ago
2010
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...