2924 search results - page 491 / 585 » Lower Bounds in Distributed Computing |
157
click to vote
CONCUR
2008
Springer
15 years 6 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
131
click to vote
EUROPAR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Now that large radiotelescopes like SKA, LOFAR, or ASKAP, become available in different parts of the world, radioastronomers foresee a vast increase in the amount of data...
162
click to vote
AIPS
2006
15 years 5 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
125
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
125
click to vote
JPDC
2007
15 years 4 months ago
2007
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...