Sciweavers

16093 search results - page 297 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
SGP
2007
15 years 9 months ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
CORR
2010
Springer
102views Education» more  CORR 2010»
15 years 1 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 7 months ago
Optimal finger search trees in the pointer machine
Gerth Stølting Brodal, George Lagogiannis, ...
136
Voted
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
16 years 4 months ago
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
Tamal K. Dey, Anil N. Hirani and Bala Krishnamoort...
NC
2002
210views Neural Networks» more  NC 2002»
15 years 6 months ago
Recent approaches to global optimization problems through Particle Swarm Optimization
This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detectin...
Konstantinos E. Parsopoulos, Michael N. Vrahatis