Sciweavers

3495 search results - page 289 / 699
» On the random satisfiable process
Sort
View
CLEIEJ
2006
126views more  CLEIEJ 2006»
15 years 7 months ago
Software Based Fault Tolerance against Byzantine Failures
The proposed software technique is a very low cost and an effective solution towards designing Byzantine fault tolerant computing application systems that are not so safety critic...
Goutam Kumar Saha
EOR
2006
103views more  EOR 2006»
15 years 7 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
ITA
2006
15 years 7 months ago
Probabilistic models for pattern statistics
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
Massimiliano Goldwurm, Roberto Radicioni
JC
2007
119views more  JC 2007»
15 years 7 months ago
Deterministic constructions of compressed sensing matrices
Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performan...
Ronald A. DeVore
JCM
2007
78views more  JCM 2007»
15 years 7 months ago
Blind CFO Estimators for OFDM/OQAM Systems With Null Subcarriers
— This paper deals with the problem of blind carrier-frequency offset (CFO) estimation in OFDM systems based on offset quadrature amplitude modulation (OFDM/OQAM) with null subca...
Tilde Fusco, Mario Tanda