Sciweavers

3571 search results - page 239 / 715
» Cohen and Set Theory
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...
SAGT
2009
Springer
177views Game Theory» more  SAGT 2009»
16 years 1 months ago
Characterizing Incentive Compatibility for Convex Valuations
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
André Berger, Rudolf Müller, Seyed Hos...
ATAL
2007
Springer
16 years 25 days ago
Incentive compatible ranking systems
Ranking systems are a fundamental ingredient of multi-agent environments and Internet Technologies. These settings can be viewed as social choice settings with two distinguished p...
Alon Altman, Moshe Tennenholtz
CAV
2006
Springer
141views Hardware» more  CAV 2006»
15 years 10 months ago
SMT Techniques for Fast Predicate Abstraction
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
Shuvendu K. Lahiri, Robert Nieuwenhuis, Albert Oli...
ENTCS
2010
66views more  ENTCS 2010»
15 years 6 months ago
A Nominal Relational Model for Local Store
The theory of nominal sets is a theory for names, freshness and binders. It has recently been suggested as a framework for modelling local store because it allows for a more eleme...
Rasmus Ejlers Møgelberg