494 search results - page 72 / 99 » Heap Building Bounds |
FUIN
2008
14 years 10 months ago
2008
Many distributed applications can be understood in terms of components interacting in an open environment such as the Internet. Open environments are subject to change in unpredic...
110
click to vote
JAIR
2008
14 years 10 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
JOC
2008
14 years 10 months ago
2008
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
ENTCS
2007
14 years 10 months ago
2007
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
SIAMSC
2008
14 years 10 months ago
2008
This paper discusses both the theoretical and statistical errors obtained by various well-known dot products, from the canonical to pairwise algorithms, and introduces a new and mo...