Result 1 to 20 of 33 total
Simple bounds for a transient queue (English)
DSN, 562-573 (2011).
1
Iterated risk measures for risk-sensitive Markov decision processes with discounted cost (English)
UAI, 573-580 (2011).
2
Tight moments-based bounds for queueing systems (English)
SIGMETRICS, 133-134 (2011).
3
Analysis of page replacement policies in the fluid limit. (English)
Oper. Res. 58, No. 4, Part 1, 971-984 (2010).
4
Differentiating the performance of systems more reliably. (English)
Perform. Eval. 67, No. 10, 929-945 (2010).
5
A fluid limit for a cache algorithm with general request processes. (English)
Adv. Appl. Probab. 42, No. 3, 816-833 (2010).
6
Analysis of page replacement policies in the fluid limit (English)
Operations Research 58, No. 4-Part-1, 971-984 (2010).
7
Semidefinite optimization for transient analysis of queues (English)
SIGMETRICS, 363-364 (2010).
8
Finding probably best systems quickly via simulations (English)
ACM Trans. Model. Comput. Simul. 19, No. 3 (2009).
9
A fluid limit for cache algorithms with general request processes (English)
INFOCOM, 2836-2840 (2009).
10
Evaluating availability under quasi-heavy-tailed repair times (English)
DSN, 442-451 (2008).
11
Accuracy of measured throughputs and mean response times. (English)
SIGMETRICS Perform. Eval. Rev. 25, No. 2, 9-11 (2007).
12
Relations in the central limit theorem version of the response time law (English)
QEST, 69-78 (2007).
13
Optimizing system configurations quickly by guessing at the performance (English)
SIGMETRICS, 145-156 (2007).
14
Finding probably best system configurations quickly. (English)
SIGMETRICS Perform. Eval. Rev. 34, No. 3, 39-41 (2006).
15
Finding probably best systems quickly via simulation (English)
Winter Simulation Conference, 2285 (2006).
16
Finding probably better system configurations quickly (English)
SIGMETRICS/Performance, 264-275 (2006).
17
Robustness of threshold policies in beneficiary-donor model. (English)
SIGMETRICS Perform. Eval. Rev. 33, No. 2, 36-38 (2005).
18
Multi-server queueing systems with multiple priority classes. (English)
Queueing Syst. 51, No. 3-4, 331-360 (2005).
19
Nearly insensitive bounds on SMART scheduling (English)
SIGMETRICS, 205-216 (2005).
20
Result 1 to 20 of 33 total
Start
Contact
Print
General Help
