5005 search results - page 324 / 1001 » The Design and Analysis of Parallel Algorithms |
148
click to vote
PRDC
2008
IEEE
15 years 11 months ago
2008
IEEE
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
138
Voted
PRDC
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper, we present a consensus algorithm for synchronous distributed systems using cooperating mobile agents. The algorithm is designed within a framework for mobile agent ...
159
click to vote
DTJ
1998
15 years 4 months ago
1998
ir increasing use of abstraction, modularity, delayed binding, polymorphism, and source reuse, especially when these attributes are used in combination. Modern processor architectu...
139
Voted
ESA
2006
Springer
15 years 8 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
128
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...