2899 search results - page 9 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
140
click to vote
SIAMSC
2008
15 years 1 months ago
2008
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
115
click to vote
WSCG
2001
15 years 2 months ago
2001
In this article we present an algorithm to determine the intersection between rays and triangles based on the idea of the study of signs with respect to triangles. One of the adva...
113
click to vote
CONCUR
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
105
click to vote
ISPE
2003
15 years 2 months ago
2003
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...