3020 search results - page 208 / 604 » Optimal partition trees |
186
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
153
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
142
click to vote
JPDC
2000
15 years 6 months ago
2000
In this paper we propose a new minimum total communication distance T CD algorithm and an optimal T CD algorithm for broadcast in a 3-dimensional mesh 3-D mesh. The former generat...
160
click to vote
TC
1998
15 years 6 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
180
click to vote
BIBE
2006
IEEE
16 years 20 days ago
2006
IEEE
An interesting and important, but largely ignored question associated with the ML method is whether there exists only a single maximum likelihood point for a given phylogenetic tr...