7758 search results - page 1403 / 1552 » On the Number of Distributive Lattices |
168
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
166
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
187
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
174
click to vote
OSDI
2004
ACM
16 years 6 months ago
2004
ACM
Detecting network path anomalies generally requires examining large volumes of traffic data to find misbehavior. We observe that wide-area services, such as peerto-peer systems an...
279
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...