3678 search results - page 207 / 736 » On the Stable Paths Problem |
133
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
127
Voted
INFOCOM
1997
IEEE
15 years 8 months ago
1997
IEEE
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
116
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
141
click to vote
AINA
2004
IEEE
15 years 7 months ago
2004
IEEE
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
158
click to vote
ISCAPDCS
2003
15 years 5 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...