نتایج جستجو برای: passing). k

تعداد نتایج: 408062  

Journal: :Discrete Mathematics, Algorithms and Applications 2019

Journal: :The Annals of The Royal College of Surgeons of England 2019

2002
Terence Kwok Kate Smith-Miles Sebastián Lozano David Taniar

The parallel fuzzy c-means (PFCM) algorithm for clustering large data sets is proposed in this paper. The proposed algorithm is designed to run on parallel computers of the Single Program Multiple Data (SPMD) model type with the Message Passing Interface (MPI). A comparison is made between PFCM and an existing parallel k-means (PKM) algorithm in terms of their parallelisation capability and sca...

Journal: :International Journal on Information and Communication Technology (IJoICT) 2017

2007
Wei Chen Jialin Zhang Yu Chen Xuezheng Liu

There have been several studies on failure detectors for solving k-set agreement, a problem that requires n processes to decide on at most k (k < n) values proposed by the n processes in systems where processes may fail by crashing. In particular, Mostefaoui et.al. study the relationship among these failure detector classes and show that class Ωk is the weakest among them to solve k-set agreeme...

Journal: :Inf. Process. Lett. 2016
Zohir Bouzid Damien Imbs Michel Raynal

This short paper presents a necessary condition for Byzantine k-set agreement in (synchronous or asynchronous) message-passing systems and asynchronous shared memory systems where the processes communicate through atomic single-writer multi-reader registers. It gives a proof, which is particularly simple, that k-set agreement cannot be solved t-resiliently in an n-process system when n ≤ 2t + t...

Journal: :CoRR 2007
Sonny Ben-Shimon Dan Vilenchik

Message passing algorithms are popular in many combinatorial optimization problems. Forexample, experimental results show that survey propagation (a certain message passing algorithm)is effective in finding proper k-colorings of random graphs in the near-threshold regime. Gallagerin 1962 introduced the concept of Low Density Parity Check (LDPC) codes, and suggested asimple d...

1996
Amotz Bar-Noy C. T. Howard Ho

We consider the problem of broadcasting multiple messages from one processor to many processors in the k-port model for message passing systems. In such systems, processors communicate in rounds, where in every round, each processor can send k messages to k processors and receive k messages from k processors. In this paper, we first present a simple and practical algorithm based on variations o...

2016
Stephanie Begun Shanna K. Kattari

Conforming for survival: Associations between transgender visual conformity/passing and homelessness experiences Stephanie Begun & Shanna K. Kattari To cite this article: Stephanie Begun & Shanna K. Kattari (2016) Conforming for survival: Associations between transgender visual conformity/passing and homelessness experiences, Journal of Gay & Lesbian Social Services, 28:1, 54-66, DOI: 10.1080/1...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید