Sciweavers

2192 search results - page 12 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ICPR
2002
IEEE
14 years 9 months ago
The Gait Identification Challenge Problem: Data Sets and Baseline Algorithm
P. Jonathon Phillips, Sudeep Sarkar, Isidro Robled...
IPPS
2007
IEEE
14 years 2 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
CEC
2009
IEEE
13 years 12 months ago
A dynamic artificial immune algorithm applied to challenging benchmarking problems
Abstract-- In many real-world scenarios, in contrast to standard benchmark optimization problems, we may face some uncertainties regarding the objective function. One source of the...
Fabrício Olivetti de França, Fernand...
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
13 years 10 months ago
New challenges for memetic algorithms on continuous multi-objective problems
Adriana Lara, Oliver Schütze, Carlos A. Coell...
TCBB
2008
103views more  TCBB 2008»
13 years 7 months ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung