Sylvain Perron

Back

Cahiers du GERAD

24 results — page 2 of 2

and

The probabilistic satisfiability problem is to verify the consistency of a set of probability values or intervals for logical propositions. The (tight) prob...

BibTeX reference
, , , and

This paper answers a query of S. Vincze (Acta Univ. Szeged, Sect. Sci. Math. 12 A (1950) 136-142): find the convex octagon with unit-length sides and minim...

BibTeX reference
and

Assouad has shown that a real-valued distance <i>d</i> = (<i>d</i><sub><i>ij</i></sub>) <sub>1 &le; <i>i</i> &lt; <i>j</i> &le; <i>n</i></sub> is isome...

BibTeX reference
, , , , and

Treatment of imprecise probabilities within the probabilistic satisfiability approach to uncertainty in knowledge-based systems is surveyed and discussed. ...

BibTeX reference