Sciweavers

2354 search results - page 43 / 471
» Randomness, Stochasticity and Approximations
Sort
View
PEWASUN
2006
ACM
14 years 1 months ago
Analytical modeling of random waypoint mobility patterns
Mobility, in its various forms, is one of the sources of several technical challenges being addressed in the last years to achieve a more flexible computing and communication inf...
Fábio Delamare, Fernando Luís Dotti,...
TPDS
2010
135views more  TPDS 2010»
13 years 6 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
AAAI
2011
12 years 7 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
SIAMNUM
2010
105views more  SIAMNUM 2010»
13 years 2 months ago
Quantization Based Filtering Method Using First Order Approximation
The quantization based filtering method (see [13], [14]) is a grid based approximation method to solve nonlinear filtering problems with discrete time observations. It relies on o...
Afef Sellami
ANSS
2005
IEEE
14 years 1 months ago
Approximation of Discrete Phase-Type Distributions
The analysis of discrete stochastic models such as generally distributed stochastic Petri nets can be done using state space-based methods. The behavior of the model is described ...
Claudia Isensee, Graham Horton