2638 search results - page 476 / 528 » Random Geometric Complexes |
OOPSLA
2010
Springer
13 years 6 months ago
2010
Springer
Fixing concurrency bugs (or crugs) is critical in modern software systems. Static analyses to find crugs such as data races and atomicity violations scale poorly, while dynamic a...
PE
2010
Springer
13 years 6 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
SCN
2010
Springer
13 years 6 months ago
2010
Springer
An identity-based encryption (IBE) scheme can greatly reduce the complexity of sending encrypted messages. However, an IBE scheme necessarily requires a private-key generator (PKG)...
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
TALG
2010
13 years 6 months ago
2010
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...