337 search results - page 18 / 68 » Optimizing yield in global routing |
170
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
181
click to vote
ASPDAC
2010
ACM
15 years 4 months ago
2010
ACM
Abstract-- We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. Th...
152
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
164
click to vote
SCHEDULING
2008
15 years 5 months ago
2008
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
142
click to vote
NSDI
2007
15 years 8 months ago
2007
Abstract – We present Wiser, an Internet routing protocol that enables ISPs to jointly control routing in a way that produces efficient end-to-end paths even when they act in th...