Sciweavers

324 search results - page 40 / 65
» Bounds for Functions of Dependent Risks
Sort
View
SIGSOFT
2002
ACM
16 years 18 days ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
JC
2008
128views more  JC 2008»
14 years 12 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
QUESTA
2010
112views more  QUESTA 2010»
14 years 10 months ago
Admission control for a multi-server queue with abandonment
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
Yasar Levent Koçaga, Amy R. Ward
MMSP
2008
IEEE
147views Multimedia» more  MMSP 2008»
15 years 6 months ago
Bit allocation for spatial scalability in H.264/SVC
Abstract—We propose a model-based spatial layer bit allocation algorithm for H.264/SVC in this work. The spatial scalability of H.264/SVC is achieved by a multi-layer approach, w...
Jiaying Liu, Yongjin Cho, Zongming Guo, C. C. Jay ...
MST
2011
200views Hardware» more  MST 2011»
14 years 6 months ago
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
Antonio Fernández Anta, José Luis L&...