Sciweavers

84 search results - page 9 / 17
» Combinatorial Optimization Solutions for the Maximum Quartet...
Sort
View
PAMI
2010
112views more  PAMI 2010»
13 years 5 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
CPAIOR
2007
Springer
14 years 1 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
VLDB
2005
ACM
116views Database» more  VLDB 2005»
14 years 29 days ago
Client Assignment in Content Dissemination Networks for Dynamic Data
Consider a content distribution network consisting of a set of sources, repositories and clients where the sources and the repositories cooperate with each other for efficient di...
Shetal Shah, Krithi Ramamritham, Chinya V. Ravisha...
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 1 months ago
A leader-based parallel cross entropy algorithm for MCP
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
Zhanhua Bai, Qiang Lv
LION
2009
Springer
115views Optimization» more  LION 2009»
14 years 2 months ago
Flexible Stochastic Local Search for Haplotype Inference
Abstract. Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genoty...
Luca Di Gaspero, Andrea Roli