Sciweavers

5158 search results - page 39 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
JUCS
2010
133views more  JUCS 2010»
13 years 3 months ago
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
Vladik Kreinovich, Bartlomiej Jacek Kubica
LICS
1994
IEEE
14 years 27 days ago
A General Semantics for Evaluation Logic
The original semantics of Evaluation Logic in [Mog93] relies on additional properties of strong monads. This paper extends the original semantics by dropping all additional requir...
Eugenio Moggi
SPDECE
2007
115views Education» more  SPDECE 2007»
13 years 10 months ago
On the General Structure of Ontologies of Instructional Models
This paper addresses the representation of the main elements of instructional models using formal ontology languages. Following existing conceptualizations, models, methods and con...
Miguel-Ángel Sicilia
ENTCS
2007
104views more  ENTCS 2007»
13 years 8 months ago
General Reversibility
The first and the second author introduced reversible ccs (rccs) in order to model concurrent computations where certain actions are allowed to be reversed. Here we t the core of...
Vincent Danos, Jean Krivine, Pawel Sobocinski
TARK
2009
Springer
14 years 3 months ago
Foundations of non-commutative probability theory
Kolmogorov’s setting for probability theory is given an original generalization to account for probabilities arising from Quantum Mechanics. The sample space has a central role ...
Daniel Lehmann