2926 search results - page 66 / 586 » Partially Optimal Routing |
84
Voted
ICIP
2006
IEEE
16 years 2 months ago
2006
IEEE
In this paper, we consider the problem of image reconstruction from the noisy blurred version of an original image when the blurring operator is partially known and the original i...
96
Voted
ICCAD
2008
IEEE
15 years 7 months ago
2008
IEEE
— The area-I/O flip-chip package provides a high chip-density solution to the demand of more I/O’s in VLSI designs; it can achieve smaller package size, shorter wirelength, an...
91
Voted
SIGCOMM
1999
ACM
15 years 5 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
114
Voted
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...
217
Voted
ICC
2011
IEEE
14 years 10 days ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...