9842 search results - page 1414 / 1969 » Problem complexity |
197
click to vote
GECCO
2004
Springer
16 years 17 days ago
2004
Springer
This paper presents a modified optimal control model of drug scheduling in cancer chemotherapy and a new adaptive elitist-population based genetic algorithm (AEGA) to solve it. Wo...
181
click to vote
ICDM
2003
IEEE
16 years 14 days ago
2003
IEEE
In this paper, we propose a novel technique for the efficient prediction of multiple continuous target variables from high-dimensional and heterogeneous data sets using a hierarch...
200
click to vote
ECCV
2010
Springer
16 years 10 days ago
2010
Springer
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...
216
click to vote
ICDM
2002
IEEE
16 years 4 days ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
172
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Given the complexity of the problem, genetic algorithms are one of the more promising methods of discovering control schemes for soft robotics. Since physically embodied evolution...