Publications associées à Algorithme de Monte-Carlo

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.

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Algorithme de Monte-Carlo

Graph Chatbot

Chattez avec Graph Search

Fast Logic Synthesis for RRAM-based In-Memory Computing using Majority-Inverter Graphs

Tight Bounds for Asynchronous Renaming

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Modelling and compensation of thermal effects on an Ironless Inductive Position Sensor

Weighted Averages and Double Exponential Algorithms

The Complexity of Renaming

Competitive ratio of List Scheduling on uniform machines and randomized heuristics

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Segment-Based Real-Time Stereo Vision Matching using Characteristics Vectors

Sorting signed permutations by inversions in O(nlogn) time

Fast Logic Synthesis for RRAM-based In-Memory Computing using Majority-Inverter Graphs

Weighted Averages and Double Exponential Algorithms

Segment-Based Real-Time Stereo Vision Matching using Characteristics Vectors

The Complexity of Renaming

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Modelling and compensation of thermal effects on an Ironless Inductive Position Sensor

Competitive ratio of List Scheduling on uniform machines and randomized heuristics

Sorting signed permutations by inversions in O(nlogn) time

Tight Bounds for Asynchronous Renaming

Optimal-Time Adaptive Strong Renaming, with Applications to Counting