Sciweavers

2543 search results - page 66 / 509
» Optimal Ordered Problem Solver
Sort
View
EMMCVPR
2011
Springer
13 years 9 months ago
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Jan Lellmann, Frank Lenzen, Christoph Schnörr
RECOMB
2000
Springer
15 years 1 months ago
Early eukaryote evolution based on mitochondrial gene order breakpoints
We present a general heuristicfor the median problem for induced breakpoints on genomes with unequal gene content and incorporate this into a routine for estimating optimal gene o...
David Sankoff, David Bryant, Mélanie Deneau...
58
Voted
ESCIENCE
2006
IEEE
15 years 1 months ago
A Differential Evolution Based Algorithm to Optimize the Radio Network Design Problem
In this paper we present a Differential Evolution based algorithm used to solve the Radio Network Design (RND) problem. This problem consists in determining the optimal locations ...
Silvio Priem-Mendes, Juan Antonio Gómez Pul...
IPCO
2004
144views Optimization» more  IPCO 2004»
14 years 11 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha
EVOW
2006
Springer
15 years 1 months ago
A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
Olfa Sammoud, Sébastien Sorlin, Christine S...