Sciweavers

10608 search results - page 417 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
CIBCB
2005
IEEE
15 years 10 months ago
Feedback Memetic Algorithms for Modeling Gene Regulatory Networks
— 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...
Christian Spieth, Felix Streichert, Jochen Supper,...
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 10 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
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 ...
Stefan Droste
RT
2005
Springer
15 years 10 months ago
Radiance Cache Splatting: A GPU-Friendly Global Illumination Algorithm
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...
Pascal Gautron, Jaroslav Krivánek, Kadi Bou...
EVOW
2004
Springer
15 years 10 months ago
Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms
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...
Enrique Alba, Bernabé Dorronsoro
3DPVT
2002
IEEE
219views Visualization» more  3DPVT 2002»
15 years 9 months ago
A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration
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...
Timothée Jost, Heinz Hügli