Sciweavers

2421 search results - page 21 / 485
» Approximate Flow-Aware Networking
Sort
View
QUESTA
2011
14 years 18 days ago
Uniform approximations for the M/G/1 queue with subexponential processing times
: This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffi...
Mariana Olvera-Cravioto, Peter W. Glynn
DAC
2011
ACM
13 years 9 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
SIAMJO
2011
14 years 4 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
ICC
2009
IEEE
145views Communications» more  ICC 2009»
14 years 7 months ago
End-to-End Delay Approximation in Cascades of Generalized Processor Sharing Schedulers
Abstract This paper proposes an analytical method to evaluate the delay violation probability of traffic flows with statistical Quality-of-Service (QoS) guarantees in a Generalize...
Paolo Giacomazzi, Gabriella Saddemi
ECAI
2010
Springer
14 years 7 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic