Sciweavers

3934 search results - page 179 / 787
» Approximate Schedulability Analysis
Sort
View
CSDA
2007
134views more  CSDA 2007»
15 years 6 months ago
Variational approximations in Bayesian model selection for finite mixture distributions
Variational methods for model comparison have become popular in the neural computing/machine learning literature. In this paper we explore their application to the Bayesian analys...
Clare A. McGrory, D. M. Titterington
ORL
2008
124views more  ORL 2008»
15 years 6 months ago
Sample average approximation of expected value constrained stochastic programs
We propose a sample average approximation (SAA) method for stochastic programming problems involving an expected value constraint. Such problems arise, for example, in portfolio s...
Wei Wang, Shabbir Ahmed
CAGD
2005
72views more  CAGD 2005»
15 years 6 months ago
Parametrization of approximate algebraic surfaces by lines
In this paper we present an algorithm for parametrizing approximate algebraic surfaces by lines. The algorithm is applicable to -irreducible algebraic surfaces of degree d having ...
Sonia Pérez-Díaz, Juana Sendra, J. R...
JAT
2010
71views more  JAT 2010»
15 years 4 months ago
Functions with prescribed best linear approximations
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...
Patrick L. Combettes, Noli N. Reyes
CCR
2006
122views more  CCR 2006»
15 years 6 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer