666 search results - page 48 / 134 » New primal-dual algorithms for Steiner tree problems |
161
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...
149
click to vote
HPCC
2005
Springer
15 years 11 months ago
2005
Springer
With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to op...
164
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
161
click to vote
CP
2008
Springer
15 years 7 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
156
click to vote
CIAC
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...