3020 search results - page 225 / 604 » Optimal partition trees |
162
click to vote
GECCO
2004
Springer
16 years 12 hour ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
164
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...
167
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
—Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions signiï...
157
click to vote
IPCO
2007
15 years 8 months ago
2007
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
169
click to vote
OPODIS
2004
15 years 8 months ago
2004
Abstract. Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable sys...