982 search results - page 144 / 197 » Solving Steiner tree problems in graphs to optimality |
92
Voted
WEBDB
2009
Springer
15 years 7 months ago
2009
Springer
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
115
click to vote
JMIV
2007
15 years 13 days ago
2007
Abstract. This paper discusses the interest of the Tree of Shapes of an image as a region oriented image representation. The Tree of Shapes offers a compact and structured represen...
170
Voted
FOCS
1993
IEEE
15 years 4 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
117
click to vote
ISPA
2007
Springer
15 years 6 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
109
click to vote
AAAI
2000
15 years 1 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...