We analyse the convergence of a GA when the mutation probability is low and the selection pressure is high, for arbitrary crossover types and probabilities. We succeed in mathemat...
We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t w...
We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability ...
-- The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The u...
I’ll describe a range of systems for nonmonotonic conditionals that behave like conditional probabilities above a threshold. The rules that govern each system are probabilistical...