16430 search results - page 284 / 3286 » On Computable Tree Functions |
163
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
139
click to vote
AINA
2006
IEEE
15 years 10 months ago
2006
IEEE
Design of protocols for mobile ad-hoc networks (MANETs) is generally tricky compared to wired networks, because on the one hand the increased communication constraints given by th...
137
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
144
click to vote
CONCUR
2004
Springer
15 years 10 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
141
click to vote
ICNC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...