Sciweavers

2814 search results - page 96 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
111
Voted
ICASSP
2010
IEEE
15 years 2 months ago
Fast total variation image restoration with parameter estimation using bayesian inference
In this paper we propose two fast Total Variation (TV) based algorithms for image restoration by utilizing variational posterior distribution approximation. The unknown image and ...
Bruno Amizic, S. Derin Babacan, K. Michael Ng, Raf...
SOCO
2012
Springer
13 years 9 months ago
Variable mesh optimization for continuous optimization problems
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
Amilkar Puris, Rafael Bello, Daniel Molina, Franci...
WADS
2009
Springer
245views Algorithms» more  WADS 2009»
15 years 9 months ago
Online Square Packing
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
Sándor P. Fekete, Tom Kamphans, Nils Schwee...
119
Voted
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 8 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
BMCBI
2011
14 years 5 months ago
Combinatorial analysis and algorithms for quasispecies reconstruction using next-generation sequencing
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
Mattia C. F. Prosperi, Luciano Prosperi, Alessandr...