2899 search results - page 68 / 580 » Dynamic Trees in Practice |
ESA
2009
Springer
14 years 3 months ago
2009
Springer
We evaluate the practical performance of labeling schemes for lowest common ancestors in trees. We develop different variants for encoding the labels. We then perform a thorough e...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
EUROCAST
2007
Springer
14 years 23 days ago
2007
Springer
Abstract. Pattern-based verification trying to abstract away the concrete number of repeated memory structures is one of the approaches that have recently been proposed for verific...
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
TACAS
2009
Springer
14 years 3 months ago
2009
Springer
Software testing is an essential process to improve software quality in practice. Researchers have proposed several techniques to automate parts of this process. In particular, sym...