982 search results - page 75 / 197 » Solving Steiner tree problems in graphs to optimality |
163
click to vote
ICANNGA
2007
Springer
15 years 8 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...
130
click to vote
ISSS
1995
IEEE
15 years 8 months ago
1995
IEEE
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
139
click to vote
AI
2010
Springer
15 years 4 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
141
Voted
DATE
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
141
click to vote
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...