Concept

Recursion (computer science)

Related publications (120)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Robust Data-Driven Dynamic Programming

Daniel Kuhn, Grani Adiwena Hanasusanto

In stochastic optimal control the distribution of the exogenous noise is typically unknown and must be inferred from limited data before dynamic programming (DP)-based solution schemes can be applied. If the conditional expectations in the DP recursions ar ...

2013

DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views

Christoph Koch, Amir Shaikhha, Milos Nikolic, Daniel Lupei, Andres Nötzli, Yanif Ahmad

Applications ranging from algorithmic trading to scientific data analysis require realtime analytics based on views over databases receiving thousands of updates each second. Such views have to be kept fresh at millisecond latencies. At the same time, thes ...

2013

Interpolation for Synthesis on Unbounded Domains

Viktor Kuncak, Régis William Blanc

Synthesis procedures compile relational specifications into functions. In addition to bounded domains, synthesis procedures are applicable to domains such as mathematical integers, where the domain and range of relations and synthesized code is unbounded. ...

Ieee2013

The Adomian Decomposition Method for Nonlinear Partial Differential Equations

Natalie Sauerwald

The goal of this report is to study the method introduced by Adomian known as the Adomian Decomposition Method (ADM), which is used to find an approximate solution to nonlinear partial differential equations (PDEs) as a series expansion involving the recur ...

2013

Integrated Kernel Partitioning and Scheduling for Coarse-Grained Reconfigurable Arrays

Giovanni Ansaloni

Coarse-grained reconfigurable arrays (CGRAs) are a promising class of architectures conjugating flexibility and efficiency. Devising effective methodologies to map applications onto CGRAs is a challenging task, due to their parallel execution paradigm and ...

Institute of Electrical and Electronics Engineers2012

DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views

Christoph Koch, Milos Nikolic, Yanif Ahmad

Applications ranging from algorithmic trading to scientific data analysis require realtime analytics based on views over databases that change at very high rates. Such views have to be kept fresh at low maintenance cost and latencies. At the same time, the ...

2012

Programming with Specifications

Philippe Paul Henri Suter

This thesis explores the use of specifications for the construction of correct programs. We go beyond their standard use as run-time assertions, and present algorithms, techniques and implementations for the tasks of 1) program verification, 2) declarative ...

EPFL2012

The weighted averages algorithm revisited

Juan Ramon Mosig

The classic weighted averages (WA) algorithm for the evaluation of Sommerfeld-like integrals is reviewed and reappraised. As a result, a new version of the WA algorithm, called generalized WA, is introduced. The new version can be considered as a generaliz ...

Institute of Electrical and Electronics Engineers2012

Partitioned Algorithms for Fluid-Structure Interaction Problems in Haemodynamics

Fabio Nobile, Christian Vergara

We consider the fluid-structure interaction problem arising in haemodynamic applications. The finite elasticity equations for the vessel are written in Lagrangian form, while the Navier-Stokes equations for the blood in Arbitrary Lagrangian Eulerian form. ...

Birkhäuser-Verlag, Springer2012

Symbolic execution of Reo circuits using constraint automata

Hossein Hojjat

Reo is a coordination language that can be used to model different systems. We propose a technique for symbolic execution of Reo circuits using the symbolic representation of data constraints in Constraint Automata. This technique enables us to obtain the ...

2012