Recherche

Afficher tous les résultats pour

Accueil

Concept

In-place algorithm

Science formelle
Informatique théorique
Algorithme
Analyse de la complexité de...

Publications associées (23)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Expectation propagation in the large data limit

Guillaume Philippe Ivan Joseph Dehaene

Expectation propagation (EP) is a widely successful algorithm for variational inference. EP is an iterative algorithm used to approximate complicated distributions, typically to find a Gaussian approximation of posterior distributions. In many applications ...

Wiley2018

Solving the Infinite-horizon Constrained LQR Problem using Accelerated Dual Proximal Methods

Colin Neil Jones, Milan Korda, Georgios Stathopoulos

This work presents an algorithmic scheme for solving the infinite-time constrained linear quadratic regulation problem. We employ an accelerated version of a popular proximal gradient scheme, commonly known as the Forward-Backward Splitting (FBS), and prov ...

Institute of Electrical and Electronics Engineers2017

A bucket sort algorithm for the particle-in-cell method on manycore architectures

Laurent Villard, Stephan Brunner, Trach-Minh Tran, Claudio Gheller

The Particle-In-Cell (PIC) method is effectively used in many scientific simulation codes. In order to optimize the performance of the PIC approach, data locality is required. This relies on efficient sorting algorithms. We present a bucket sort algorithm ...

Springer2016

Contribution to the Ultra-Fast Charging of Electric Vehicles : The Configurable Modular Multilevel Converter (CMMC)

Rosa Martel Danoary Tsirinomeny

It is generally agreed that one of the drawbacks of a conventional vehicle is the inability to always reach the best operating point of the engine and the inability to regenerate the kinetic energy. Meaning, even with the help of the gearbox or automatic t ...

EPFL2016

A generic algorithm for checking exhaustivity of pattern matching

Fengyun Liu

Algebraic data types and pattern matching are key features of functional programming languages. Exhaustivity checking of pattern matching is a safety belt that defends against unmatched exceptions at runtime and boosts type safety. However, the presence of ...

2016

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

Divesh Aggarwal

We give a randomized 2^{n+o(n)}-time and space algorithm for solving the Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest algorithm: the deterministic O(4^n)-time and O(2^n)-space algorithm of Miccian ...

ACM2015

The $ L ^{ 1 } $ -Potts Functional for Robust Jump-Sparse Reconstruction

Martin Kurt Storath

We investigate the nonsmooth and nonconvex

L ^{ 1 }

-Potts functional in discrete and continuous time. We show Γ-convergence of discrete

L ^{ 1 }

-Potts functionals toward their continuous counterpart and obtain a convergence statement for the corr ...

SIAM2015

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Modular multilevel battery packaging for a universal and flexible EVs charging system

Rosa Martel Danoary Tsirinomeny

Electric Vehicles (EVs) carmakers are heavily confronted by the limited fault ride-through capabilities of actual EVs battery packs. Therefore, this paper introduces a new method of EVs battery packaging based on modular multilevel battery modules as well ...

2014

Majority Logic Representation and Satisfiability

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

Majority logic is a powerful generalization of common AND/OR logic. Original two-level and multi-level logic networks can use majority operators as primitive connective, in place of AND/ORs. In such a way, Boolean functions have novel means for compact rep ...

2014

Page 2 sur 3

L ^{ 1 }

-Potts functional in discrete and continuous time. We show Γ-convergence of discrete

L ^{ 1 }

-Potts functionals toward their continuous counterpart and obtain a convergence statement for the corr ...

SIAM2015