Sciweavers

2354 search results - page 277 / 471
» Randomness, Stochasticity and Approximations
Sort
View
EOR
2011
124views more  EOR 2011»
15 years 1 months ago
Analysis of order-up-to-level inventory systems with compound Poisson demand
: We analyse a single echelon single item inventory system where the demand and the lead time are stochastic. Demand is modelled as a compound Poisson process and the stock is cont...
M. Zied Babai, Zied Jemaï, Yves Dallery
TOG
2010
97views more  TOG 2010»
15 years 26 days ago
A practical simulation of dispersed bubble flow
In this paper, we propose a simple and efficient framework for simulating dispersed bubble flow. Instead of modeling the complex hydrodynamics of numerous small bubbles explicitly...
Doyub Kim, Oh-Young Song, Hyeong-Seok Ko
INFOCOM
2007
IEEE
16 years 14 days ago
Paradox of Shortest Path Routing for Large Multi-Hop Wireless Networks
— In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of p...
Sungoh Kwon, Ness B. Shroff
TSP
2008
151views more  TSP 2008»
15 years 6 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
COMBINATORICA
2007
119views more  COMBINATORICA 2007»
15 years 5 months ago
Complete partitions of graphs
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
Magnús M. Halldórsson, Guy Kortsarz,...