Dijkstra–Scholten algorithm

Known as: Dijkstra-Scholten algorithm

The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and Carel S. Scholten) is an algorithm for detecting termination in a distributed…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

ii Access to decent sanitation remains a problem in developing countries. At the same time, sanitation technology is constantly…

2015

We saw that using the multiplicative weights (MW) algorithm, we find a (1 + ε)-approximate max flow f̂—i.e., a flow of value F…

2013

Purpose: The purpose of this study was to investig ate whether language discourse followed a diurnal pattern across one 10-hour…

2011

Bilinguals activate words from both languages when listening to spoken sentences: Evidence from an ERP-study Nicole Altvater…

2010

This study investigated the role of verbal working memory on bilingual lexical disambiguation. Spanish–English bilinguals read…

2007

We present an equational decision procedure a la Dijkstra & Scholten for the 'Syllogistic Logic with Complements'. Keywords…

2006

2002

Dijkstra and van Heuven have made an admirable attempt to develop a new model of bilingual memory, the BIA+. Their article…

1995

A number of lattice-theoretic fixed point rules are generalised to category theory and applied to the construction of…

1991