830 search results - page 53 / 166 » Route kernels for trees |
152
click to vote
NETWORKS
2010
15 years 2 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
106
click to vote
DAC
1993
ACM
15 years 8 months ago
1993
ACM
We present an efficient and effective method for the detailed routing of symmetrical or sea-of-gates FPGA architectures. Instead of breaking the problem into 2-terminal net collec...
141
click to vote
CNSR
2010
IEEE
15 years 8 months ago
2010
IEEE
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...
132
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
139
click to vote
ASPLOS
2012
ACM
13 years 11 months ago
2012
ACM
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared addre...