Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings.
Karl R. AbrahamsonAndrew AdlerLisa HighamDavid G. KirkpatrickPublished in: J. ACM (1994)
Keyphrases
- lower bound
- upper bound
- np hard
- branch and bound
- worst case
- probabilistic model
- lower and upper bounds
- branch and bound algorithm
- objective function
- optimal solution
- generative model
- bayesian networks
- linear programming relaxation
- model checking
- verification method
- lower bounding
- quadratic assignment problem
- upper and lower bounds
- probability theory
- set of randomly generated instances
- peer to peer
- online algorithms
- formal verification
- probabilistic logic
- face verification
- probabilistic reasoning
- data structure
- information theoretic
- data driven