Sciweavers

8 search results - page 1 / 2
» A Matrix Pattern Compliant Strong Stochastic Bound
Sort
View
SAINT
2005
IEEE
13 years 10 months ago
A Matrix Pattern Compliant Strong Stochastic Bound
Stochastic bounds are a promising method to analyze QoS requirements. Indeed it is sufficient to prove that a bound of the real performance satisfies the guarantee. However, the...
Ana Busic, Jean-Michel Fourneau
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
TSP
2011
170views more  TSP 2011»
12 years 11 months ago
Joint TDOA and FDOA Estimation: A Conditional Bound and Its Use for Optimally Weighted Localization
—Modern passive emitter-location systems are often based on joint estimation of the time-difference of arrival (TDOA) and frequency-difference of arrival (FDOA) of an unknown sig...
Arie Yeredor, Eyal Angel
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
13 years 10 months ago
Conductance and congestion in power law graphs
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
Christos Gkantsidis, Milena Mihail, Amin Saberi
CORR
2006
Springer
125views Education» more  CORR 2006»
13 years 4 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski