153 search results - page 3 / 31 » An experimental study of greedy routing algorithms |
75
Voted
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
APPROX
2000
Springer
15 years 1 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
101
click to vote
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
CLUSTER
2002
IEEE
14 years 9 months ago
2002
IEEE
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
ICSE
2005
IEEE-ACM
15 years 9 months ago
2005
IEEE-ACM
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one ...