Sciweavers

582 search results - page 16 / 117
» What Will Probably Happen
Sort
View
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
ACSAC
2003
IEEE
14 years 2 months ago
PSOS Revisited
This paper provides a retrospective view of the design of SRI’s Provably Secure Operating System (PSOS), a formally specified tagged-capability hierarchical system architecture...
Peter G. Neumann, Richard J. Feiertag
ICMCS
2005
IEEE
86views Multimedia» more  ICMCS 2005»
14 years 2 months ago
Integration of rule-based and model-based decision methods for baseball event detection
To exactly detect what events occur in baseball games, a framework that integrates rule-based and model-based decision methods is proposed. The rule-based decision module infers w...
Wei-Ta Chu, Ja-Ling Wu
ISIPTA
2005
IEEE
119views Mathematics» more  ISIPTA 2005»
14 years 2 months ago
Ordinal Subjective Foundations for Finite-domain Probability Agreement
Normative study of probability-agreeing orderings of propositions, much of it rooted in a false but evocative conjecture of Bruno de Finetti, has typically sought to credal ration...
Paul Snow
ISIPTA
2003
IEEE
14 years 2 months ago
Geometry of Upper Probabilities
In this paper we adopt the geometric approach to the theory of evidence to study the geometric counterparts of the plausibility functions, or upper probabilities. The computation ...
Fabio Cuzzolin