14518 search results - page 140 / 2904 » Two Problems for Sophistication |
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
EUROGP
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
SIAMCOMP
2008
13 years 10 months ago
2008
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The Discretizable Molecular Distance Geometry Problem is a subset of instances of the distance geometry problem that can be solved by a combinatorial algorithm called "Branch-...
IPPS
2008
IEEE
14 years 4 months ago
2008
IEEE
—Scheduling and dispatching are two ways of solving production planning problems. In this work, based on preceding works, it is explained how these two approaches can be combined...