Sciweavers

478 search results - page 95 / 96
» A simple expected running time analysis for randomized
Sort
View
SOSP
2003
ACM
14 years 4 months ago
Capriccio: scalable threads for internet services
This paper presents Capriccio, a scalable thread package for use with high-concurrency servers. While recent work has advocated event-based systems, we believe that threadbased sy...
J. Robert von Behren, Jeremy Condit, Feng Zhou, Ge...
FMSB
2008
142views Formal Methods» more  FMSB 2008»
13 years 9 months ago
Generic Reactive Animation: Realistic Modeling of Complex Natural Systems
Abstract. Natural systems, such as organs and organisms, are largescale complex systems with numerous elements and interactions. Modeling such systems can lead to better understand...
David Harel, Yaki Setty
STACS
2009
Springer
14 years 2 months ago
Economical Caching
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
Matthias Englert, Heiko Röglin, Jacob Spö...
WCNC
2008
IEEE
14 years 1 months ago
Proportional Fair Scheduling: Analytical Insight under Rayleigh Fading Environment
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
Erwu Liu, Kin K. Leung
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo