16093 search results - page 31 / 3219 » On the optimality of the neighbor-joining algorithm |
137
click to vote
ICTAI
2010
IEEE
14 years 11 months ago
2010
IEEE
When a local optimal solution is reached with classical Particle Swarm Optimization (PSO), all particles in the swarm gather around it, and escaping from this local optima becomes...
AMC
2005
15 years 1 months ago
2005
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
117
click to vote
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
134
click to vote
IDA
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. The goal of this article is to introduce a collaborative clustering approach to the domain of ubiquitous knowledge discovery. This clustering approach is suitable in peer...
144
click to vote
COLT
2010
Springer
14 years 11 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...