Sciweavers

38 search results - page 2 / 8
» Extending Polynomial Chaos to Include Interval Analysis
Sort
View
ATMOS
2007
119views Optimization» more  ATMOS 2007»
13 years 6 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
WCNC
2008
IEEE
13 years 11 months ago
Subspace Blind MIMO-OFDM Channel Estimation with Short Averaging Periods: Performance Analysis
—Among all blind channel estimation problems, subspace-based algorithms are attractive due to its fastconverging nature. It primarily exploits the orthogonality structure of the ...
Chao-Cheng Tu, Benoît Champagne
RC
1998
82views more  RC 1998»
13 years 4 months ago
A Note on Epsilon-Inflation
Abstract. The epsilon-inflation proved to be useful and necessary in many verification algorithms. Different definitions of an epsilon-inflation are possible, depending on the...
Siegfried M. Rump
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
13 years 8 months ago
Polynomial Time Summary Statistics for Two general Classes of Functions
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...
Robert B. Heckendorn
EOR
2007
102views more  EOR 2007»
13 years 4 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux