982 search results - page 93 / 197 » Solving Steiner tree problems in graphs to optimality |
184
click to vote
SIAMJO
2008
15 years 5 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
138
click to vote
GECCO
2007
Springer
16 years 3 days ago
2007
Springer
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
168
click to vote
EMNLP
2011
14 years 5 months ago
2011
Machine-produced text often lacks grammaticality and fluency. This paper studies grammaticality improvement using a syntax-based algorithm based on CCG. The goal of the search pr...
162
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
—In this paper, we formulate an optimization problem for the design of light-tree based logical topology in Wavelength Division Multiplexing (WDM) networks. The problem is compri...
154
click to vote
GECCO
2007
Springer
16 years 3 days ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...