An Asynchronous Message-Passing Distributed Algorithm for the Generalized Local Critical Section Problem †

Publisher： MDPI

E-ISSN： 1999-4893|10|2|38-38

ISSN： 1999-4893

Source： Algorithms, Vol.10, Iss.2, 2017-03, pp. : 38-38

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Two-Stage Method to Test the Robustness of the Generalized Approximate Message Passing Algorithm

By You Qingshan Luo Yongjie Wan Qun

Algorithms, Vol. 9, Iss. 4, 2016-11 ,pp. : 79-79

MDPI

Access to resources Recommend Favorite

A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint

By Zhu Daxin Wang Xiaodong

Algorithms, Vol. 6, Iss. 3, 2013-08 ,pp. : 485-493

MDPI

Access to resources Recommend Favorite

An Adaptive h -Refinement Algorithm for Local Damage Models

By Pitt Jonathan S. Costanzo Francesco

Algorithms, Vol. 2, Iss. 4, 2009-10 ,pp. : 1281-1300

MDPI

Access to resources Recommend Favorite

An Efficient Local Search for the Feedback Vertex Set Problem

By Zhang Zhiqiang Ye Ansheng Zhou Xiaoqing Shao Zehui

Algorithms, Vol. 6, Iss. 4, 2013-11 ,pp. : 726-746

MDPI

Access to resources Recommend Favorite

An Open-Source Implementation of the Critical-Line Algorithm for Portfolio Optimization

By Bailey David H. de Prado Marcos López

Algorithms, Vol. 6, Iss. 1, 2013-03 ,pp. : 169-196

MDPI

Access to resources Recommend Favorite