Sciweavers

29908 search results - page 378 / 5982
» On the complexity of communication complexity
Sort
View
203
Voted
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
16 years 23 days ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
SIGIR
2006
ACM
16 years 23 days ago
Building a test collection for complex document information processing
Research and development of information access technology for scanned paper documents has been hampered by the lack of public test collections of realistic scope and complexity. A...
David D. Lewis, Gady Agam, Shlomo Argamon, Ophir F...
ICSM
2005
IEEE
16 years 12 days ago
Strider: Configuration Modelling and Analysis of Complex Systems
This paper describes an approach and support tool for the modelling and analysis of proposed reconfigurations to complex systems. The configuration models used are quick to constr...
Simon Lock
189
Voted
ANCS
2005
ACM
16 years 11 days ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
16 years 11 days ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan