Displaying similar documents to “Phenotype space and kinship assignment for the simpson index”

Job shop scheduling with unit length tasks

Meike Akveld, Raphael Bernhard (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in operations research. More specifically, we deal with a particular version called . Using the results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work , we analyze the problem setting for 2 jobs with an unequal number of tasks. We contribute a deterministic algorithm which achieves a vanishing delay in certain cases and a randomized algorithm with a competitive...

Job shop scheduling with unit length tasks

Meike Akveld, Raphael Bernhard (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in operations research. More specifically, we deal with a particular version called . Using the results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work , we analyze the problem setting for 2 jobs with an unequal number of tasks. We contribute a deterministic algorithm which achieves a vanishing delay in...

Convergence Rates of the POD–Greedy Method

Bernard Haasdonk (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

Iterative approximation algorithms are successfully applied in parametric approximation tasks. In particular, reduced basis methods make use of the so-called Greedy algorithm for approximating solution sets of parametrized partial differential equations. Recently, convergence rate statements for this algorithm have been given (Buffa 2009, Binev 2010). The goal of the current study is the extension to time-dependent problems, which are typically approximated using the POD–Greedy algorithm...

convergence of the Greedy algorithm for the parametrized reduced basis method

Annalisa Buffa, Yvon Maday, Anthony T. Patera, Christophe Prud’homme, Gabriel Turinici (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the “reduced basis”. The purpose of this paper is to analyze the convergence for one of the approaches used for the selection of these elements, the greedy algorithm. Under natural hypothesis on the set of all solutions to the problem obtained when the parameter varies,...

convergence of the Greedy algorithm for the parametrized reduced basis method

Annalisa Buffa, Yvon Maday, Anthony T. Patera, Christophe Prud’homme, Gabriel Turinici (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the “reduced basis”. The purpose of this paper is to analyze the convergence for one of the approaches used for the selection of these elements, the greedy algorithm. Under natural hypothesis on the set of all solutions to the problem obtained when the parameter varies,...