Sciweavers

9572 search results - page 306 / 1915
» Cover Algorithms and Their Combination
Sort
View
IPPS
2007
IEEE
16 years 29 days ago
Performance Analysis of a Family of WHT Algorithms
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
Michael Andrews, Jeremy Johnson
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 10 months ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
3DIM
2003
IEEE
15 years 12 months ago
Reliable and Rapidly-Converging ICP Algorithm Using Multiresolution Smoothing
Autonomous range acquisition for 3D modeling requires reliable range registration, for both the precise localization of the sensor and combining the data from multiple scans for v...
Kok-Lim Low, Anselmo Lastra
GECCO
2006
Springer
122views Optimization» more  GECCO 2006»
15 years 10 months ago
Genetic algorithms are suitable for driving microbial ecosystems in desirable directions
The behavior of natural, biological ecosystems is for a large part determined by environmental conditions. It should therefore be possible to experimentally manipulate such condit...
Frederik P. J. Vandecasteele, Thomas F. Hess, Rona...
CSL
2008
Springer
15 years 8 months ago
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
Sven Schewe