4488 search results - page 333 / 898 » Focusing Search by Using Problem Solving Experience |
152
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engag...
206
click to vote
RECOMB
2001
Springer
16 years 5 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
139
click to vote
ICCAD
2005
IEEE
16 years 1 months ago
2005
IEEE
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
154
click to vote
CCO
2001
Springer
15 years 9 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
138
click to vote
ECAL
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Genetic regulatory networks (GRNs) control gene expression and are responsible for establishing the regular cellular patterns that constitute an organism. This paper intr...