Sciweavers

6320 search results - page 1187 / 1264
» Towards Situated Computing
Sort
View
SIGECOM
2009
ACM
111views ECommerce» more  SIGECOM 2009»
15 years 10 months ago
A qualitative vickrey auction
Restricting the preferences of the agents by assuming that their utility functions linearly depend on a payment allows for the positive results of the Vickrey auction and the Vick...
Paul Harrenstein, Mathijs de Weerdt, Vincent Conit...
106
Voted
ATAL
2007
Springer
15 years 9 months ago
Commitment and extortion
Making commitments, e.g., through promises and threats, enables a player to exploit the strengths of his own strategic position as well as the weaknesses of that of his opponents....
Paul Harrenstein, Felix Brandt, Felix A. Fischer
133
Voted
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 9 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
155
Voted
CIA
2007
Springer
15 years 9 months ago
Learning Initial Trust Among Interacting Agents
Trust learning is a crucial aspect of information exchange, negotiation, and any other kind of social interaction among autonomous agents in open systems. But most current probabil...
Achim Rettinger, Matthias Nickles, Volker Tresp
118
Voted
EUROCRYPT
2007
Springer
15 years 9 months ago
Feistel Networks Made Public, and Applications
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...
Yevgeniy Dodis, Prashant Puniya
« Prev « First page 1187 / 1264 Last » Next »