Sciweavers

16093 search results - page 35 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
JMLR
2010
113views more  JMLR 2010»
14 years 8 months ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...
IJSIR
2010
122views more  IJSIR 2010»
14 years 8 months ago
Biases in Particle Swarm Optimization
It is known that the most common versions of particle swarm optimization (PSO) algorithms are rotationally variant. It has also been pointed out that PSO algorithms can concentrat...
William M. Spears, Derek T. Green, Diana F. Spears
MOC
2010
14 years 8 months ago
Optimizing the double description method for normal surface enumeration
Abstract. Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a con...
Benjamin A. Burton
GECCO
2009
Springer
127views Optimization» more  GECCO 2009»
15 years 6 months ago
BBOB-benchmarking the Rosenbrock's local search algorithm
The restarted Rosenbrock’s optimization algorithm is tested on the BBOB 2009 testbed. The algorithm turned out to be very efficient for functions with simple structure (independ...
Petr Posik
IEEEVAST
2010
14 years 8 months ago
Interactive visual analysis of multiobjective optimizations
Optimization problems are typically addressed by purely automatic approaches. For multi-objective problems, however, a single best solution often does not exist. In this case, it ...
Wolfgang Berger, Harald Piringer