3678 search results - page 228 / 736 » On the Stable Paths Problem |
140
Voted
JCO
2006
15 years 5 months ago
2006
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
137
click to vote
MICCAI
2005
Springer
16 years 5 months ago
2005
Springer
In this study we address the problem of extracting a robust connectivity metric for brain white matter. We defined the connectivity problem as an energy minimization task, by assoc...
142
Voted
APCCAS
2006
IEEE
15 years 11 months ago
2006
IEEE
— This paper aims at introducing a new design tool based on polynomial optimization, which can be used to obtain globally optimal designs for stable IIR filters, single-stage an...
157
click to vote
CSR
2009
Springer
15 years 11 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
146
Voted
LATIN
2010
Springer
15 years 3 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...