Concept

Proof theory

Related publications (150)

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.

Primal-dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs

Carsten Moldenhauer

NODE-WEIGHTED STEINER FOREST is the following problem: Given an undirected graph, a set of pairs of terminal vertices, a weight function on the vertices, find a minimum weight set of vertices that includes and connects each pair of terminals. We consider t ...

Academic Press Inc Elsevier Science2011

Slow Time Behavior of the Semidiscrete Perona–Malik Scheme in One Dimension

Maria Colombo

We consider the long time behavior of the semidiscrete scheme for the Perona-Malik equation in one dimension. We prove that approximated solutions converge, in a slow time scale, to solutions of a limit problem. This limit problem evolves piecewise constan ...

2011

On the Brauer group of diagonal quartic surfaces

Evis Ieronymou

We obtain an easy sufficient condition for the Brauer group of a diagonal quartic surface D over Q to be algebraic. We also give an upper bound for the order of the quotient of the Brauer group of D by the image of the Brauer group of Q. The proof is based ...

2011

Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems

Martin Biely

Despite of being quite similar (agreement) problems, 1-set agreement (consensus) and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than the relatively sim ...

Springer2011

Introducing qualitative dimensions to analyze the usefulness of Web 2.0 platforms as PLEs

Denis Gillet, Stéphane Sire, Evgeny Bogdanov

The trends in web development of educational applications and of Web 2.0 or social applications are converging. Platforms are designed to host a variety of software components (called widgets or plugins), which can be organised or combined (mashed-up) at u ...

2011

Polymer Coiled-Coil Conjugates: Potential for Development as a New Class of Therapeutic “Molecular Switch”

Harm-Anton Klok

Polymer therapeutics, including polymeric drugs and polymer-protein conjugates, are clinically established as first-generation nanomedicines. Knowing that the coiled-coil peptide motif is fundamentally important in the regulation of many cellular and patho ...

2011

On 1-norm stochastic optimal control with bounded control inputs

Milan Korda

This paper deals with the finite horizon stochastic optimal control problem with the expectation of the 1-norm as the objective function and jointly Gaussian, although not necessarily independent, disturbances. We develop an approximation strategy that sol ...

2011

Byzantine agreement with homonyms

Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert

So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general mo ...

ACM Press2011

Oriented paths in n-chromatic digraphs

Rajai Nasser

In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first treat the case of antidirected paths in 5-chromatic digraphs, where we explain El-Sahili’s theorem and provide an elementary and shorter proof of it. We then tr ...

2010

Stochastic Optimization of Sailing Trajectories in an America's Cup Race

Frédéric Dumas

The main objective of the thesis is the study and the determination of an optimal navigation strategy, for a sailboat in an America's Cup race, by methods of stochastic optimization. Such methods are appropriate because the sailing team expects the wind to ...

EPFL2010