Sciweavers

3571 search results - page 44 / 715
» Cohen and Set Theory
Sort
View
ISIPTA
2003
IEEE
110views Mathematics» more  ISIPTA 2003»
14 years 27 days ago
Extensions of Expected Utility Theory and Some Limitations of Pairwise Comparisons
We contrast three decision rules that extend Expected Utility to contexts where a convex set of probabilities is used to depict uncertainty: Γ-Maximin, Maximality, and E-admissib...
Mark J. Schervish, Teddy Seidenfeld, Joseph B. Kad...
ACM
1995
13 years 11 months ago
Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
Zdzislaw Pawlak
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 5 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
FOCS
1999
IEEE
13 years 12 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
JAIR
2006
89views more  JAIR 2006»
13 years 7 months ago
Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
Philippe Adjiman, Philippe Chatalic, Franço...