10 search results - page 1 / 2 » A novel particle swarm optimization for the Steiner tree pro... |
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
76
Voted
NC
2010
14 years 10 months ago
2010
100
click to vote
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
114
click to vote
ICANNGA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
123
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...