Sciweavers

172 search results - page 4 / 35
» On the cost of searching signature trees
Sort
View
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 28 days ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
BMCBI
2010
135views more  BMCBI 2010»
13 years 7 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
13 years 11 months ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
13 years 11 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
ISW
1997
Springer
13 years 11 months ago
Signcryption and Its Applications in Efficient Public Key Solutions
Signcryption is a new paradigm in public key cryptography that simultaneously fulfills both the functions of digital signature and public key encryption in a logically single step,...
Yuliang Zheng