699 search results - page 128 / 140 » The method of combinatorial telescoping |
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
MM
2010
ACM
13 years 8 months ago
2010
ACM
This paper presents an interactive image segmentation framework which is ultra-fast and accurate. Our framework, termed "CO3", consists of three components: COupled repr...
SMA
2010
ACM
13 years 8 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
AI
2008
Springer
13 years 8 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...