Sciweavers

1341 search results - page 110 / 269
» Automatic Algorithm Configuration Based on Local Search
Sort
View
GECCO
2005
Springer
147views Optimization» more  GECCO 2005»
15 years 5 months ago
Adaptive sizing of populations and number of islands in distributed genetic algorithms
Deciding the appropriate population size and number of islands for distributed island-model genetic algorithms is often critical to the algorithm’s success. This paper outlines ...
Johan Berntsson, Maolin Tang
GECCO
2009
Springer
200views Optimization» more  GECCO 2009»
15 years 6 months ago
Optimization of the trading rule in foreign exchange using genetic algorithm
The generation of profitable trading rules for Foreign Exchange (FX) investments is a difficult but popular problem. The use of Machine Learning in this problem allows us to obtai...
Akinori Hirabayashi, Claus de Castro Aranha, Hitos...
TEC
2002
163views more  TEC 2002»
14 years 11 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
SIGIR
2006
ACM
15 years 5 months ago
User modeling for full-text federated search in peer-to-peer networks
User modeling for information retrieval has mostly been studied to improve the effectiveness of information access in centralized repositories. In this paper we explore user model...
Jie Lu, James P. Callan
BMCBI
2011
14 years 3 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes