Publication

SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus

Publications associées (48)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

In-situ localized carbon nanotube growth inside partially sealed enclosures

Yves Bellouard

Carbon nanotube assemblies can be used for specific applications such as sensors and filters. We present a method and proof-of-concept to directly grow vertically-aligned carbon nanotube structures within sealed enclosures by means of a feedback-controlled ...

American Institute of Physics2013

A Fully Dynamic Universal Accumulator

Serge Vaudenay, Atefeh Mashatan

A dynamic universal accumulator is an accumulator that allows one to efficiently compute both membership and nonmembership witnesses in a dynamic way. It was first defined and instantiated by Li et al., based on the Strong RSA problem, building on the dyna ...

2013

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the a ...

Assoc Computing Machinery2012

Passing to the limit in maximal slope curves: from a regularized Perona–Malik equation to the total variation flow

Maria Colombo

We prove that solutions of a mildly regularized Perona–Malik equation converge, in a slow time scale, to solutions of the total variation flow. The convergence result is global-in-time, and holds true in any space dimension. The proof is based on the gener ...

2012

Exploiting the ALICE HLT for PROOF by scheduling of Virtual Machines

Marco Meoni

The HLT (High-Level Trigger) group of the ALICE experiment at the LHC has prepared a virtual Parallel ROOT Facility (PROOF) enabled cluster (HAF - HLT Analysis Facility) for fast physics analysis, detector calibration and reconstruction of data samples. Th ...

Iop Publishing Ltd, Dirac House, Temple Back, Bristol Bs1 6Be, England2011

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

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

Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound

David Pritchard

Recently, Byrka, Grandoni, RothvoBand Sanita gave a 1.39 approximation for the Steiner tree problem, using a hypergraph-based linear programming relaxation. They also upper-bounded its integrality gap by 1.55. We describe a shorter proof of the same integr ...

Elsevier2010

Interactive Parallel Analysis on the ALICE Grid with the PROOF Framework

Marco Meoni

The ALICE experiment at CERN LHC is intensively using a PROOF cluster for fast analysis and reconstruction. The current system (CAF - CERN Analysis Facility) consists of 120 CPU cores and about 45 TB of local space. PROOF enables interactive parallel proce ...

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