Sciweavers

9405 search results - page 1436 / 1881
» Computing a Model of Set Theory
Sort
View
239
Voted
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
184
Voted
ATAL
2006
Springer
15 years 10 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo
ATAL
2003
Springer
15 years 10 months ago
A false-name-proof double auction protocol for arbitrary evaluation values
We develop a new false-name-proof double auction protocol called the Generalized Threshold Price Double auction (GTPD) protocol. False-name-proofness generalizes strategyproofness...
Yuko Sakurai, Makoto Yokoo
190
Voted
IMC
2007
ACM
15 years 8 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...
DGO
2007
121views Education» more  DGO 2007»
15 years 8 months ago
Social capital and ICT adoption in the public sector
Although the research domain on social capital and the adoption of Information and Communication Technologies (ICTs) is relatively immature, there is a fast growing body of eviden...
Noor Huijboom
« Prev « First page 1436 / 1881 Last » Next »