253 search results - page 5 / 51 » Edge and Node Searching Problems on Trees |
105
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
A rectilinear Steiner arborescence (RSA) is a tree, whose nodes include a prescribed set of points, termed the vertices, in the first quadrant of the Cartesian plane, and whose tr...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
ALGORITHMICA
2004
14 years 11 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
CISIS
2009
IEEE
15 years 6 months ago
2009
IEEE
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...