2924 search results - page 255 / 585 » Lower Bounds in Distributed Computing |
131
click to vote
LOGCOM
2010
15 years 2 months ago
2010
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
113
Voted
TRANSCI
2011
14 years 11 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
181
click to vote
ICDCS
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
111
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Compositional performance analysis iteratively alternates local scheduling analysis techniques and output event model propagation between system components to enable performance a...
141
click to vote
ICDCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Data reliability of distributed brick storage systems critically depends on the replica placement policy, and the two governing forces are repair speed and sensitivity to multiple...