16093 search results - page 93 / 3219 » On the optimality of the neighbor-joining algorithm |
112
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
101
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...
128
click to vote
TPDS
1998
15 years 1 months ago
1998
This paper presents a new compiler optimization algorithm that parallelizes applications for symmetric, sharedmemory multiprocessors. The algorithm considers data locality, parall...
118
click to vote
ICCSA
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we address the problem of working paths optimization in survivable MPLS network. We focus on an existing facility network, in which only network flows can be optimize...
121
click to vote
UAI
2003
15 years 2 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...