16093 search results - page 367 / 3219 » On the optimality of the neighbor-joining algorithm |
166
click to vote
ANTSW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a modified version of the Particle swarm Optimization algorithm in which we adjust the virtual swarm search by incorporating inter-agent dynamics native to mul...
174
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
189
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
239
click to vote
ICMLA
2004
15 years 8 months ago
2004
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
149
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...