Results 21 to 30 of about 119,463 (291)

A novel chaotic and neighborhood search-based artificial bee colony algorithm for solving optimization problems

open access: yesScientific Reports, 2023
With the development of artificial intelligence, numerous researchers are attracted to study new heuristic algorithms and improve traditional algorithms. Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the
Wen-sheng Xiao   +3 more
doaj   +1 more source

A fair distributed mutual exclusion algorithm [PDF]

open access: yesIEEE Transactions on Parallel and Distributed Systems, 2000
This paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N-1 and 2(N-1) messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a deterministic
Sandeep Lodha, Ajay D. Kshemkalyani
openaire   +2 more sources

A queue based mutual exclusion algorithm [PDF]

open access: yesActa Informatica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex A. Aravind, Wim H. Hesselink
openaire   +2 more sources

Efficient reduction of nondeterministic automata with application to language inclusion testing [PDF]

open access: yesLogical Methods in Computer Science, 2019
We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages.
Lorenzo Clemente, Richard Mayr
doaj   +1 more source

Dynamic sharing of a multiple access channel [PDF]

open access: yes, 2010
In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed computing.
Bienkowski, Marcin   +3 more
core   +3 more sources

Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion

open access: yesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2023
We present tradeoffs between RMR complexity and memory word size for recoverable mutual exclusion (RME) algorithms using arbitrary synchronization primitives.
D. Y. C. Chan   +2 more
semanticscholar   +1 more source

Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots [PDF]

open access: yes, 2019
In this paper, we define a new concept neighborhood mutual remainder (NMR). An NMR distributed algorithms should satisfy global fairness, l-exclusion and repeated local rendezvous requirements.
Dolev, Shlomi   +4 more
core   +1 more source

Distributed match-making [PDF]

open access: yes, 1987
In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making ...
Mullender, Sape J., Vitanyi, Paul M.B.
core   +5 more sources

Brief Announcement: Fast and Scalable Group Mutual Exclusion [PDF]

open access: yes, 2018
The group mutual exclusion (GME) problem is a generalization of the classical mutual exclusion problem in which every critical section is associated with a type or session. Critical sections belonging to the same session can execute concurrently, whereas
Gokhale, Shreyas, Mittal, Neeraj
core   +1 more source

A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set [PDF]

open access: yes, 2007
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type (or a group) with each critical section.
Neeraj Mittal   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy