50 search results - page 3 / 10 » Maximum inner-product search using cone trees |
AAAI
1996
13 years 7 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
BIBM
2008
IEEE
14 years 22 days ago
2008
IEEE
We present new and novel insights into the behavior of two maximum parsimony heuristics for building evolutionary trees of different sizes. First, our results show that the heuris...
ENTCS
2007
13 years 5 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
WABI
2005
Springer
13 years 11 months ago
2005
Springer
Phylogenetic tree searching algorithms often produce thousands of trees which biologists save in Newick format in order to perform further analysis. Unfortunately, Newick is neithe...
COR
2006
13 years 6 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...