Sciweavers

8016 search results - page 275 / 1604
» On the practical genetic algorithms
Sort
View
MAM
2007
157views more  MAM 2007»
15 years 6 months ago
Executing large algorithms on low-capacity FPGAs using flowpath partitioning and runtime reconfiguration
This paper describes a new method of executing a software program on an FPGA for embedded systems. Rather than combine reconfigurable logic with a microprocessor core, this method...
Darrin M. Hanna, Michael DuChene
BMCBI
2010
84views more  BMCBI 2010»
15 years 6 months ago
A variational Bayes algorithm for fast and accurate multiple locus genome-wide association analysis
Background: The success achieved by genome-wide association (GWA) studies in the identification of candidate loci for complex diseases has been accompanied by an inability to expl...
Benjamin A. Logsdon, Gabriel E. Hoffman, Jason G. ...
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
16 years 1 months ago
Environmental robustness in multi-agent teams
Evolution has proven to be an effective method of training heterogeneous multi-agent teams of autonomous agents to explore unknown environments. Autonomous, heterogeneous agents ...
Terence Soule, Robert B. Heckendorn
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
16 years 24 days ago
Real-coded ECGA for economic dispatch
In this paper, we propose a new approach that consists of the extended compact genetic algorithm (ECGA) and split-ondemand (SoD), an adaptive discretization technique, to economic...
Chao-Hong Chen, Ying-Ping Chen
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
16 years 1 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar