982 search results - page 148 / 197 » Solving Steiner tree problems in graphs to optimality |
149
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
145
click to vote
BIS
2008
15 years 5 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
126
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We consider fair allocation of sessions at the outputs of optical cross-connects employing wavelength division multiplexing (WDM). Each session consists of traffic on one or m...
118
click to vote
SAC
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
132
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...