253 search results - page 27 / 51 » Edge and Node Searching Problems on Trees |
101
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
TCAD
2002
14 years 9 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
CP
2011
Springer
13 years 9 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
115
click to vote
IKE
2003
14 years 11 months ago
2003
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
ISCAPDCS
2003
14 years 11 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...