Sciweavers

294 search results - page 59 / 59
» A hybrid metaheuristic approach to solving the UBQP problem
Sort
View
CP
1995
Springer
13 years 11 months ago
On the Forward Checking Algorithm
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...
Fahiem Bacchus, Adam J. Grove
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
13 years 11 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 2 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
ICRA
2002
IEEE
152views Robotics» more  ICRA 2002»
14 years 14 days ago
Mobile Robot Self-Localization in Large-Scale Environments
— This paper presents a new approach for the absolute self-localization of a mobile robot in structured large-scale environments. The requirements with regard to both, the necess...
Axel Lankenau, Thomas Röfer