Sciweavers

854 search results - page 113 / 171
» Abstracting from Failure Probabilities
Sort
View
INFOCOM
2002
IEEE
15 years 9 months ago
A Robust Acknowledgement Scheme for Unreliable Flows
Abstract—The increasing presence of UDP traffic in the Internet and the emergence of sensing applications which do not require full reliability motivates the search for a robust...
Hoi-sheung Wilson So, Ye Xia, Jean C. Walrand
FUN
2010
Springer
254views Algorithms» more  FUN 2010»
15 years 9 months ago
The Urinal Problem
Abstract. A man walks into a men’s room and observes n empty urinals. Which urinal should he pick so as to maximize his chances of maintaining privacy, i.e., minimize the chance ...
Evangelos Kranakis, Danny Krizanc
CONCUR
2001
Springer
15 years 9 months ago
Compositional Methods for Probabilistic Systems
Abstract. We present a compositional trace-based model for probabilistic systems. The behavior of a system with probabilistic choice is a stochasticprocess, namely, a probability d...
Luca de Alfaro, Thomas A. Henzinger, Ranjit Jhala
EUROGP
2001
Springer
110views Optimization» more  EUROGP 2001»
15 years 9 months ago
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover
Abstract. In this paper a new, general and exact schema theory for genetic programming is presented. The theory includes a microscopic schema theorem applicable to crossover operat...
Riccardo Poli
ASIACRYPT
2000
Springer
15 years 9 months ago
Key Improvements to XTR
Abstract. This paper describes improved methods for XTR key representation and parameter generation (cf. [4]). If the field characteristic is properly chosen, the size of the XTR ...
Arjen K. Lenstra, Eric R. Verheul