2434 search results - page 328 / 487 » Algorithmic Randomness of Closed Sets |
99
Voted
OPODIS
2004
15 years 5 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
105
Voted
COMCOM
2010
15 years 3 months ago
2010
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as...
138
Voted
ENDM
2006
15 years 3 months ago
2006
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
136
click to vote
COR
2007
15 years 3 months ago
2007
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
145
Voted
CVIU
2007
15 years 3 months ago
2007
A Bayesian framework is proposed for stereo vision where solutions to both the model parameters and the disparity map are posed in terms of predictions of latent variables, given ...