1007 search results - page 46 / 202 » The Complexity of Futile Questioning |
VLDB
1997
ACM
14 years 1 months ago
1997
ACM
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...
WWW
2011
ACM
13 years 4 months ago
2011
ACM
There is a widespread intuitive sense that different kinds of information spread differently on-line, but it has been difficult to evaluate this question quantitatively since it ...
STOC
2005
ACM
14 years 10 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
SYNASC
2005
IEEE
14 years 3 months ago
2005
IEEE
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
SIAMCOMP
2011
13 years 4 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...