Sciweavers

1027 search results - page 167 / 206
» Comparing Search Algorithms for the Temperature Inversion Pr...
Sort
View
BMCBI
2010
135views more  BMCBI 2010»
13 years 9 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
14 years 3 months ago
Two-level of nondominated solutions approach to multiobjective particle swarm optimization
In multiobjective particle swarm optimization (MOPSO) methods, selecting the local best and the global best for each particle of the population has a great impact on the convergen...
M. A. Abido
ATAL
2010
Springer
13 years 10 months ago
Cultivating desired behaviour: policy teaching via environment-dynamics tweaks
In this paper we study, for the first time explicitly, the implications of endowing an interested party (i.e. a teacher) with the ability to modify the underlying dynamics of the ...
Zinovi Rabinovich, Lachlan Dufton, Kate Larson, Ni...
IJON
2008
88views more  IJON 2008»
13 years 9 months ago
Neural network construction and training using grammatical evolution
The term neural network evolution usually refers to network topology evolution leaving the network's parameters to be trained using conventional algorithms. In this paper we ...
Ioannis G. Tsoulos, Dimitris Gavrilis, Euripidis G...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals