Sciweavers

481 search results - page 51 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
14 years 1 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
VLDB
1997
ACM
97views Database» more  VLDB 1997»
14 years 24 days ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
JSAC
2008
140views more  JSAC 2008»
13 years 8 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 9 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
DAGSTUHL
2004
13 years 10 months ago
Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...
William I. Gasarch, Frank Stephan