Publications associées à Linear recurrence with constant coefficients

Solving the infinite-horizon constrained LQR problem using splitting techniques

Colin Neil Jones, Milan Korda, Georgios Stathopoulos

This paper presents a method to solve the constrained infinite-time linear quadratic regulator (LQR) problem. We use an operator splitting technique, namely the alternating minimization algorithm (AMA), to split the problem into an unconstrained LQR proble ...

2014

Solving the infinite-horizon constrained LQR problem using splitting techniques

Colin Neil Jones, Milan Korda, Georgios Stathopoulos

This paper presents a method to solve the constrained infinite-time linear quadratic regulator (LQR) problem. We use an operator splitting technique, namely the alternating minimization algorithm (AMA), to split the problem into an unconstrained LQR proble ...

Elsevier2014

DynaProg for Scala

Thierry Coppey

Dynamic programming is an algorithmic technique to solve problems that follow the Bellman’s principle: optimal solutions depends on optimal sub-problem solutions. The core idea behind dynamic programming is to memoize intermediate results into matrices to ...

2013

Distributed average consensus with quantization refinement

Pascal Frossard, Ye Pu, Effrosyni Kokiopoulou

We consider the problem of distributed average consensus in a sensor network where sensors exchange quantized information with their neighbors. We propose a novel quantization scheme that exploits the increasing correlation between the values exchanged by ...

Institute of Electrical and Electronics Engineers2013

Defining new criteria for selection of cell-based intestinal models using publicly available databases

Michel Aguet, Mauro Delorenzi, Pascale Anderle Pedone, Thierry Sengstag

Background: The criteria for choosing relevant cell lines among a vast panel of available intestinal-derived lines exhibiting a wide range of functional properties are still ill-defined. The objective of this study was, therefore, to establish objective cr ...

BioMed Central2012

Progressive quantization in distributed average consensus

Pascal Frossard, Effrosyni Kokiopoulou

We consider the problem of distributed average consensus in a sensor network where sensors exchange quantized information with their neighbors. In particular, we exploit the increasing correlation between the exchanged values throughout the iterations of t ...

2012

Progressive quantization in distributed average consensus

Pascal Frossard, Effrosyni Kokiopoulou

We consider the problem of distributed average consensus in a sensor network where sensors exchange quantized information with their neighbors. In particular, we exploit the increasing correlation between the exchanged values throughout the iterations of t ...

2011

Finding Loop Invariants for Programs over Arrays Using a Theorem Prover

Laura Ildiko Kovacs

We present a new method for automatic generation of loop invariants for programs containing arrays. Unlike all previously known methods, our method allows one to generate first-order invariants containing alternations of quantifiers. The method is based on ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

A path integral formalism of DNA looping probability

Ludovica Cotta-Ramusino

In this thesis we describe a path integral formalism to evaluate approximations to the probability density function for the location and orientation of one end of a continuum polymer chain at thermodynamic equilibrium with a heat bath. We concentrate on th ...

EPFL2008

Aligator: A mathematica package for invariant generation

Laura Ildiko Kovacs

We describe the new software package Aligator for automatically inferring polynomial loop invariants, The package combines algorithms from symbolic summation and polynomial algebra with computational logic, and is applicable to the rich class of P-solvable ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Linear recurrence with constant coefficients

Solving the infinite-horizon constrained LQR problem using splitting techniques

Solving the infinite-horizon constrained LQR problem using splitting techniques

DynaProg for Scala

Distributed average consensus with quantization refinement

Defining new criteria for selection of cell-based intestinal models using publicly available databases

Progressive quantization in distributed average consensus

Progressive quantization in distributed average consensus

Finding Loop Invariants for Programs over Arrays Using a Theorem Prover

A path integral formalism of DNA looping probability

Aligator: A mathematica package for invariant generation

Graph Chatbot

Chattez avec Graph Search

Solving the infinite-horizon constrained LQR problem using splitting techniques

Solving the infinite-horizon constrained LQR problem using splitting techniques

A path integral formalism of DNA looping probability

Defining new criteria for selection of cell-based intestinal models using publicly available databases

Aligator: A mathematica package for invariant generation

Distributed average consensus with quantization refinement

DynaProg for Scala

Progressive quantization in distributed average consensus

Finding Loop Invariants for Programs over Arrays Using a Theorem Prover

Progressive quantization in distributed average consensus