Sciweavers

1026 search results - page 49 / 206
» An Optimal Solution to Room Search Problem
Sort
View
DATE
2005
IEEE
112views Hardware» more  DATE 2005»
15 years 5 months ago
TDMA Time Slot and Turn Optimization with Evolutionary Search Techniques
In this paper we present arithmetic real-coded variation operators tailored for time slot and turn optimization on TDMA-scheduled resources with evolutionary algorithms. Our opera...
Arne Hamann, Rolf Ernst
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
15 years 6 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
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 6 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...
ICCV
2011
IEEE
13 years 12 months ago
Geometrically Consistent Elastic Matching of 3D Shapes: A Linear Programming Solution
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...
CORR
2006
Springer
160views Education» more  CORR 2006»
14 years 12 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer