Sciweavers

2487 search results - page 107 / 498
» cases 2009
Sort
View
106
Voted
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
15 years 7 months ago
Latency Constrained Aggregation in Chain Networks Admits a PTAS
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
Tim Nonner, Alexander Souza
105
Voted
WINE
2009
Springer
182views Economy» more  WINE 2009»
15 years 7 months ago
Competitive Repeated Allocation without Payments
We study the problem of allocating a single item repeatedly among multiple competing agents, in an environment where monetary transfers are not possible. We design (Bayes-Nash) inc...
Mingyu Guo, Vincent Conitzer, Daniel M. Reeves
193
Voted
ARGMAS
2009
Springer
15 years 7 months ago
Multi-Party Argument from Experience
Abstract. A framework, PISA, for conducting dialogues to resolve disputes concerning the correct categorisation of particular cases, is described. Unlike previous systems to conduc...
Maya Wardeh, Trevor J. M. Bench-Capon, Frans Coene...
80
Voted
ATAL
2009
Springer
15 years 7 months ago
A mathematical analysis of collective cognitive convergence
Multi-agent systems are an attractive approach to modeling systems of interacting entities, but in some cases mathematical models of these systems can offer complementary benefits...
H. Van Dyke Parunak
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
15 years 7 months ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen