3495 search results - page 288 / 699 » On the random satisfiable process |
180
click to vote
WSC
2001
15 years 8 months ago
2001
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
186
click to vote
AAAI
1997
15 years 8 months ago
1997
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
184
click to vote
VISAPP
2007
15 years 8 months ago
2007
We consider the problem of image deconvolution. We foccus on a Bayesian approach which consists of maximizing an energy obtained by a Markov Random Field modeling. MRFs are classi...
182
click to vote
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—The probability of a miss in the detection of a signal in an optical communications system through the turbulent atmosphere using intensity modulation is studied. The turbulence...
206
click to vote
CSDA
2008
15 years 7 months ago
2008
In this paper we present the results of a simulation study to explore the ability of Bayesian parametric and nonparametric models to provide an adequate fit to count data, of the t...