1376 search results - page 95 / 276 » Searching Trees: An Essay |
188
click to vote
ICALP
2004
Springer
16 years 7 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
161
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
198
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: A common clustering method in the analysis of gene expression data has been hierarchical clustering. Usually the analysis involves selection of clusters by cutting the...
166
click to vote
CP
2005
Springer
16 years 12 days ago
2005
Springer
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
188
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...