10988 search results - page 503 / 2198 » Algorithmic Folding Complexity |
206
click to vote
CIBCB
2005
IEEE
16 years 13 days ago
2005
IEEE
— In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of memetic algori...
170
Voted
GECCO
2005
Springer
16 years 10 days ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
160
click to vote
RT
2005
Springer
16 years 8 days ago
2005
Springer
Fast global illumination computation is a challenge in several fields such as lighting simulation and computergenerated visual effects for movies. To this end, the irradiance cac...
169
click to vote
EVOW
2004
Springer
16 years 6 days ago
2004
Springer
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...
180
click to vote
3DPVT
2002
IEEE
15 years 11 months ago
2002
IEEE
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...