1612 search results - page 167 / 323 » Analysing Randomized Distributed Algorithms |
109
Voted
SPAA
1998
ACM
15 years 6 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
110
Voted
NSPW
2003
ACM
15 years 8 months ago
2003
ACM
The ability to analyze and modify binaries is often very useful from a security viewpoint. Security operations one would like to perform on binaries include the ability to extract...
131
Voted
ENVSOFT
2006
15 years 2 months ago
2006
A global sensitivity analysis with regional properties is introduced. This method is demonstrated on two synthetic and one hydraulic example. It can be shown that an uncertainty a...
147
Voted
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
188
Voted
PODC
2011
ACM
14 years 5 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...