958 search results - page 66 / 192 » Resolving the Micropayment Problem |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
ECOOP
2006
Springer
15 years 1 months ago
2006
Springer
In spite of the more advanced modularisation mechanisms, aspect-oriented programs still suffer from evolution problems. Due to the fragile pointcut problem, seemingly safe modifica...
104
click to vote
AUSAI
2008
Springer
14 years 12 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...