Sciweavers

8810 search results - page 1588 / 1762
» Openness
Sort
View
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 9 months 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,...
PDIS
1993
IEEE
15 years 9 months ago
The Kendall Square Query Decomposer
d Abstract:: ACM SIGMOD Record 22 (4), Dec. 1993) RM93 Rahm, E., Marek, R.: Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems. Proc 19th VL...
David S. Reiner
LICS
1994
IEEE
15 years 9 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
ICS
2010
Tsinghua U.
15 years 9 months ago
Weight Distribution and List-Decoding Size of Reed-Muller Codes
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
Tali Kaufman, Shachar Lovett, Ely Porat
ICS
2010
Tsinghua U.
15 years 9 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
« Prev « First page 1588 / 1762 Last » Next »