982 search results - page 60 / 197 » Solving Steiner tree problems in graphs to optimality |
114
click to vote
MOR
2007
14 years 9 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
UAI
2001
14 years 11 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
ISLPED
2003
ACM
15 years 3 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...