Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Machine de Turing non déterministe

Publications associées (16)

A PCP Theorem for Interactive Proofs and Applications

Alessandro Chiesa

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Wind profile prediction in an urban canyon: a machine learning approach

Jean-Louis Scartezzini, Dasaraden Mauree, Roberto Castello, Gianluca Mancini

Resolving the wind profile in an urban canyon environment means dealing with the turbulent nature of the stream and the presence of non-negligible flux exchanges with the atmosphere inside the canopy, making any deterministic model solution computationally ...

IOP2019

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Ola Nils Anders Svensson

A sparsifier of a graph G (Bencztir and Karger; Spielman and Teng) is a sparse weighted subgraph (G) over tilde that approximately retains the same cut structure of G. For general graphs, non-trivial sparsification is possible only by using weighted graphs ...

IEEE COMPUTER SOC2019

Formal Analysis of Human-Assisted Smart City Emergency Services

Mohammad Khaja Nazeeruddin

The concept of IoT-based Smart Cities has gained momentum in recent years. The research in this domain has focused on modeling key characteristics of future smart cities along with exploring their design and implementation aspects from multiple perspective ...

2019

Block Oriented Programming: Automating Data-Only Attacks

Mathias Josef Payer

With the widespread deployment of Control-Flow Integrity (CFI), control-flow hijacking attacks, and consequently code reuse attacks, are significantly more difficult. CFI limits control flow to well-known locations, severely restricting arbitrary code exec ...

ASSOC COMPUTING MACHINERY2018

Towards self-consistent plasma modelisation in presence of Neoclassical Tearing Mode and sawteeth: effects on transport coefficients

Olivier Sauter

The neoclassical tearing modes (NTM) increase the effective heat and particle radial transport inside the plasma, leading to a flattening of the electron and ion temperature and density profiles at a given location depending on the safety factor q ration ...

2017

An empirical study on the characterization of machined surface integrity by chip morphology in dry end-milling of titanium alloy

Muhammad Arif

Titanium alloys manifest low thermal conductivity and high work hardenability in machining. These alloys are thus considered as difficult-to-machine at higher cutting speeds and pose serious problems in machining such as degraded machined surface and rapid ...

Professional Engineering Publishing2014

State Machine Replication : from Analytical Evaluation to High-Performance Paxos

Nuno Filipe de Sousa Santos

Since their invention more than half a century ago, computers have gone from being just an handful of expensive machines each filling an entire room, to being an integral part of almost every aspect of modern life. Nowadays computers are everywhere: in our ...

EPFL2012

Hardness Of Precedence Constrained Scheduling On Identical Machines

Ola Nils Anders Svensson

In 1966, Graham showed that a simple procedure called list scheduling yields a 2-approximation algorithm for the central problem of scheduling precedence constrained jobs on identical machines to minimize makespan. To date this has remained the best algori ...

2011

An Optimal Linear-Time Algorithm for Interprocedural Register Allocation in High Level Synthesis Using SSA Form

Paolo Ienne, Philip Brisk, Ajay Kumar Verma

An optimal linear-time algorithm for interprocedural register allocation in high level synthesis is presented. Historically, register allocation has been modeled as a graph coloring problem, which is nondeterministic polynomial time-complete in general; ho ...

2010

Model checking transactional memories

Rachid Guerraoui

Model checking transactional memories (TMs) is difficult because of the unbounded number, length, and delay of concurrent transactions, as well as the unbounded size of the memory. We show that, under certain conditions satisfied by most TMs we know of, th ...

Springer Verlag2010

2D-TUCKER Is PPAD-Complete

Doemoetoer Palvoelgyi

Tucker's lemma states that if we triangulate the unit disc centered at the origin and color the vertices with {1, 1,2, 2} in an antipodal way (if vertical bar z vertical bar = 1, then the sum of the colors of z and -z is zero), then there must be an edge F ...

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

Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers

Jean-Yves Le Boudec, Gianluca Rizzo

Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees are required. For networks of FIFO aggregate schedulers, the main existing suffic ...

2008

Completeness and Nondeterminism in Model Checking Transactional Memories

Rachid Guerraoui

Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the first deterministic specification automata for strict serializability and opacit ...

2008

Distributed Coverage: From Deterministic to Probabilistic Models

Alcherio Martinoli, Nicolaus Correll

For the multi-robot coverage problem determin- istic deliberative as well as probabilistic approaches have been proposed. Whereas deterministic approaches usually provide provable completeness and promise good performance under perfect conditions, probabil ...

2007

Robust Distributed Coverage using a Swarm of Miniature Robots

Alcherio Martinoli, Nicolaus Correll

For the multi-robot coverage problem deterministic deliberative as well as probabilistic approaches have been proposed. Whereas deterministic approaches usually provide provable completeness and promise good performance under perfect conditions, probabilis ...

2007