Publication

TSPP methodology for producing parallel probabilistic algorithms from specifications

1994
Conference paper

Abstract

The general aim of the project is to give a framework to a designer of parallel algorithms for defining abstractly a problem, finding a first parallel solution which may not be the most efficient one, and refining the solution by exploitingmassive parallelism and probabilistic features.

Official source

https://infoscience.epfl.ch/record/54538?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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.

TSPP methodology for producing parallel probabilistic algorithms from specifications

Graph Chatbot

Chat with Graph Search

A ride time-oriented scheduling algorithm for dial-a-ride problems

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles

A ride time-oriented scheduling algorithm for dial-a-ride problems

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles