Sciweavers

291 search results - page 4 / 59
» How Well Can Primal-Dual and Local-Ratio Algorithms Perform
Sort
View
RECOMB
2009
Springer
14 years 8 months ago
How Many Bootstrap Replicates Are Necessary?
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...
Nicholas D. Pattengale, Masoud Alipour, Olaf R. P....
ICCS
2001
Springer
13 years 12 months ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow
CEC
2005
IEEE
13 years 9 months ago
Population based incremental learning with guided mutation versus genetic algorithms: iterated prisoners dilemma
Axelrod’s original experiments for evolving IPD player strategies involved the use of a basic GA. In this paper we examine how well a simple GA performs against the more recent P...
Timothy Gosling, Nanlin Jin, Edward P. K. Tsang
CEC
2007
IEEE
14 years 1 months ago
On performance metrics and particle swarm methods for dynamic multiobjective optimization problems
— This paper describes two performance measures for measuring an EMO (Evolutionary Multiobjective Optimization) algorithm’s ability to track a time-varying Paretofront in a dyn...
Xiaodong Li, Jürgen Branke, Michael Kirley
ICIP
2010
IEEE
13 years 4 months ago
Objective assessment of tone mapping algorithms
There has been a growing interest in recent years to develop tone mapping algorithms that can convert high dynamic range (HDR) to low dynamic range (LDR) images, so that they can ...
Hojatollah Yeganeh, Zhou Wang