Sciweavers

3406 search results - page 89 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
GCB
1997
Springer
74views Biometrics» more  GCB 1997»
14 years 10 days ago
Using constraint programming for lattice protein folding
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
Rolf Backofen
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
13 years 12 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
SPAA
2010
ACM
13 years 8 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 2 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...
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
14 years 1 months ago
A Novel Multi-objective Orthogonal Simulated Annealing Algorithm for Solving Multi-objective Optimization Problems with a Large
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...
Li-Sun Shu, Shinn-Jang Ho, Shinn-Ying Ho, Jian-Hun...