Sciweavers

1898 search results - page 217 / 380
» Weak Keys for IDEA
Sort
View
SCP
2000
119views more  SCP 2000»
13 years 10 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
JAL
2002
113views more  JAL 2002»
13 years 9 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
JSYML
1998
61views more  JSYML 1998»
13 years 9 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
13 years 9 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
TOSEM
2002
118views more  TOSEM 2002»
13 years 9 months ago
Modeling software architectures in the Unified Modeling Language
Abstract. The Unified Modeling Language (UML) is a family of design notations that is rapidly becoming a de facto standard software design language. UML provides a variety of usefu...
Nenad Medvidovic, David S. Rosenblum, David F. Red...