801 search results - page 63 / 161 » Minimal Locked Trees |
188
click to vote
JSAC
2010
15 years 4 months ago
2010
Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
195
click to vote
TSE
2010
15 years 1 months ago
2010
Search-based software engineering is an emerging paradigm that uses automated search algorithms to help designers iteratively find solutions to complicated design problems. For exa...
205
click to vote
BMCBI
2011
15 years 26 days ago
2011
Background: As one of the most widely used parsimony methods for ancestral reconstruction, the Fitch method minimizes the total number of hypothetical substitutions along all bran...
167
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
165
click to vote
ISAAC
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...