982 search results - page 148 / 197 » Solving Steiner tree problems in graphs to optimality |
110
Voted
INFOCOM
2008
IEEE
15 years 7 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...
107
Voted
BIS
2008
15 years 2 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 ...
93
Voted
INFOCOM
2007
IEEE
15 years 6 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...
SAC
2005
ACM
15 years 6 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...
101
Voted
ICCV
2007
IEEE
16 years 2 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 ...