1951 search results - page 237 / 391 » An algorithm for improving graph partitions |
173
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
158
click to vote
FTTCS
2006
15 years 5 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
131
Voted
ICCAD
1998
IEEE
15 years 9 months ago
1998
IEEE
In this paper, we present results for significantly improving the performance of sequential circuit diagnostic test pattern generation (DATPG). Our improvements are achieved by de...
135
click to vote
DSD
2007
IEEE
15 years 11 months ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
133
Voted
SIGECOM
2006
ACM
15 years 11 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...