Sciweavers

3 search results - page 1 / 1
» Analysis of an Efficient Distributed Algorithm for Mutual Ex...
Sort
View
CONPAR
1992
13 years 8 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
TPDS
2002
97views more  TPDS 2002»
13 years 3 months ago
On Distributed Dynamic Channel Allocation in Mobile Cellular Networks
Distributed dynamic channel allocation (DDCA) is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not e...
Jianping Jiang, Ten-Hwang Lai, Neelam Soundarajan
AI
2008
Springer
13 years 4 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino