197 search results - page 6 / 40 » A Parallel Algorithm for Solving Large Convex Minimax Proble... |
JPDC
2006
13 years 7 months ago
2006
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
ACID
2006
13 years 9 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
ICPP
2002
IEEE
14 years 14 days ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...