Sciweavers

71 search results - page 5 / 15
» Unions and the axiom of choice
Sort
View
SYNTHESE
2010
102views more  SYNTHESE 2010»
13 years 6 months ago
Coherent choice functions under uncertainty
We discuss several features of coherent choice functions – where the admissible options in a decision problem are exactly those which maximize expected utility for some probabil...
Teddy Seidenfeld, Mark J. Schervish, Joseph B. Kad...
ETT
2000
106views Education» more  ETT 2000»
13 years 7 months ago
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
Igal Sason, Shlomo Shamai
CADE
2006
Springer
14 years 7 months ago
Cut-Simulation in Impredicative Logics
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
Christoph Benzmüller, Chad E. Brown, Michael ...
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
MSS
2008
IEEE
88views Hardware» more  MSS 2008»
13 years 7 months ago
Maximizing an interval order on compact subsets of its domain
Maximal elements of a binary relation on compact subsets of a metric space define a choice function. An infinite extension of transitivity is necessary and sufficient for such a c...
Nikolai S. Kukushkin