Publications related to Monte Carlo algorithm

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

Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon

Resistive Random Access Memories (RRAMs) have gained high attention for a variety of promising applications especially the design of non-volatile in-memory computing devices. In this paper, we present an approach for the synthesis of RRAM-based logi ...

IEEE2016

Tight Bounds for Asynchronous Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...

Association for Computing Machinery2014

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

Boi Faltings, Immanuel Trummer

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A s ...

Institute of Electrical and Electronics Engineers2014

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

Yves Perriard, Alessandro Danisi, Alessandro Masi

The Ironless Inductive Position Sensor can be the ideal candidate for linear position sensing in harsh environment and in presence of external magnetic fields. Starting from the validated electromagnetic characteristics, this paper presents a model of ther ...

Institute of Electrical and Electronics Engineers2014

Weighted Averages and Double Exponential Algorithms

Juan Ramon Mosig

This paper reviews two simple numerical algorithms particularly useful in Computational ElectroMagnetics (CEM): the Weighted Averages (WA) algorithm and the Double Exponential (DE) quadrature. After a short historical introduction and an elementary descrip ...

Ieice-Inst Electronics Information Communications Eng2013

The Complexity of Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

We study the complexity of renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct names from a given namespace. We prove an individual lower bound of Omega(k) process steps for deterministic renaming into ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

Competitive ratio of List Scheduling on uniform machines and randomized heuristics

Antoine Musitelli, Jean-Marc Nicoletti

We study online scheduling on m uniform machines, where m - 1 of them have a reference speed 1 and the last one a speed s with 0

Springer US2011

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

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

Jean-Philippe Thiran

Stereo vision is a usual method to obtain depth information from images. The problems encountered when applying well established algorithms to real-time applications are due to the high computational load required. In this article we address this issue by ...

2011

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Vaibhav Rajan, Krister Swenson

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...

2010

Monte Carlo algorithm

Graph Chatbot

Chat with 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

The Complexity of Renaming

Tight Bounds for Asynchronous Renaming

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Sorting signed permutations by inversions in O(nlogn) time

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

Competitive ratio of List Scheduling on uniform machines and randomized heuristics

Weighted Averages and Double Exponential Algorithms

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

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

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