801 search results - page 72 / 161 » Minimal Locked Trees |
178
click to vote
ISPD
2010
ACM
16 years 1 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
165
click to vote
COCOA
2009
Springer
16 years 28 days ago
2009
Springer
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
150
click to vote
IPPS
2007
IEEE
16 years 20 days ago
2007
IEEE
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
158
click to vote
DATE
2006
IEEE
16 years 12 days ago
2006
IEEE
The existence of non-uniform thermal gradients on the substrate in high performance IC’s can significantly impact the performance of global on-chip interconnects. This issue is...
156
click to vote
CAAN
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...