Principy samočinných číslicových počítačů
Probabilistic analysis of Carlitz compositions.
Probabilistic analysis of two euclidean location problems
Probabilistic evaluation of fuzzy quantified sentences: independence profile.
This paper describes a classification for fuzzy quantifiers that makes it possible to include a significant number of cases of interest (exception, comparatives). All quantifiers therein described can be evaluated by following a fuzzy model with probabilistic interpretation, based on the Theory of Generalized Quantifiers.
Probabilistic models for pattern statistics
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is to compare models based on Markovian processes (where the occurrence of a symbol in a given position only depends on a finite number of previous occurrences) and the stochastic models that can generate a word of given length from a regular language under uniform distribution. We present some results that show the differences...
Probabilistic operational semantics for the lambda calculus
Probabilistic operational semantics for a nondeterministic extension of pure λ-calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics, inductively and coinductively defined, are given. Moreover, small-step and big-step semantics are shown to produce identical outcomes, both in call-by-value and in call-by-name. Plotkin’s CPS translation is extended to accommodate the choice operator and shown correct with respect...
Probabilistic operational semantics for the lambda calculus
Probabilistic operational semantics for a nondeterministic extension of pure λ-calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics, inductively and coinductively defined, are given. Moreover, small-step and big-step semantics are shown to produce identical outcomes, both in call-by-value and in call-by-name. Plotkin’s CPS translation is extended to accommodate the choice operator and shown correct with respect...
Probabilistic operational semantics for the lambda calculus
Probabilistic operational semantics for a nondeterministic extension of pure λ-calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics, inductively and coinductively defined, are given. Moreover, small-step and big-step semantics are shown to produce identical outcomes, both in call-by-value and in call-by-name. Plotkin’s CPS translation is extended to accommodate the choice operator and shown correct with respect...
Probabilistic propositional calculus with doubled nonstandard semantics
The classical propositional language is evaluated in such a way that truthvalues are subsets of the set of all positive integers. Such an evaluation is projected in two different ways into the unit interval of real numbers so that two real-valued evaluations are obtained. The set of tautologies is proved to be identical, in all the three cases, with the set of classical propositional tautologies, but the induced evaluations meet some natural properties of probability measures with respect to nonstandard...
Probabilistic verification of proofs.
Probability timed automata for investigating communication processes
Exploitation characteristics behaves as a decreasing valors factor (DVF) which can be connected with degradation processes. It is a structure that consists of independent attributes which represent situations generally connected with a given exploitation factor. The multi-attribute structure contains attributes directly and indirectly referring to the main factor. Attribute states, by definition, can only maintain or decrease their values. Such situations are met in security, reliability, exploitation,...
Problems remaining NP-complete for sparse or dense graphs
For each fixed pair α,c > 0 let INDEPENDENT SET () and INDEPENDENT SET () be the problem INDEPENDENT SET restricted to graphs on n vertices with or edges, respectively. Analogously, HAMILTONIAN CIRCUIT () and HAMILTONIAN PATH () are the problems HAMILTONIAN CIRCUIT and HAMILTONIAN PATH restricted to graphs with edges. For each ϵ > 0 let HAMILTONIAN CIRCUIT (m ≥ (1 - ϵ)(ⁿ₂)) and HAMILTONIAN PATH (m ≥ (1 - ϵ)(ⁿ₂)) be the problems HAMILTONIAN CIRCUIT and HAMILTONIAN PATH restricted...
Problémy matematické lingvistiky řešené československými matematiky
Proč počítáme a co počítáme?
Procedures for Kernel Approximation and Solution of Fredholm Integral Equations of the Second Kind.
Procédures optimales pour le classement des meilleurs articles parmi au moyen de comparaisons binaires
Product form parametric representation of the solutions to a quadratic boolean equation
Production en temps réel et complexité de structure de suites infinies
Program flow analysis for reducing and estimating the cost of test coverage criteria. (Abstract).
Progress of iteration theory since 1981.