Sciweavers

14244 search results - page 2511 / 2849
» Modeling Program Predictability
Sort
View
123
Voted
ICALP
2009
Springer
15 years 10 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
ICALP
2009
Springer
15 years 10 months ago
Qualitative Concurrent Stochastic Games with Imperfect Information
Abstract. We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players...
Vincent Gripon, Olivier Serre
DSN
2009
IEEE
15 years 10 months ago
MAP-AMVA: Approximate mean value analysis of bursty systems
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
Giuliano Casale, Evgenia Smirni
181
Voted
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
15 years 10 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
FCT
2009
Springer
15 years 10 months ago
Small-Space Analogues of Valiant's Classes
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
Meena Mahajan, B. V. Raghavendra Rao
« Prev « First page 2511 / 2849 Last » Next »