Sciweavers

887 search results - page 177 / 178
» A Time for Choosing
Sort
View
ICDCN
2011
Springer
12 years 11 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
VR
2012
IEEE
337views Virtual Reality» more  VR 2012»
12 years 3 months ago
VRMDS: an intuitive virtual environment for supporting the conceptual design of mechanisms
This paper presents Virtual Reality Mechanism Design Studio (VRMDS), an intuitive virtual environment for supporting the interactive design and simulation of mechanisms. The studio...
Juan Camilo Alvarez, Hai-Jun Su
INFOCOM
2012
IEEE
11 years 10 months ago
Truthful spectrum auction design for secondary networks
Abstract—Opportunistic wireless channel access by nonlicensed users has emerged as a promising solution for addressing the bandwidth scarcity challenge. Auctions represent a natu...
Yuefei Zhu, Baochun Li, Zongpeng Li
SODA
2012
ACM
278views Algorithms» more  SODA 2012»
11 years 10 months ago
Beyond myopic best response (in Cournot competition)
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yish...
NIS
1998
131views more  NIS 1998»
13 years 7 months ago
Dynamic Memory Allocation for Large Query Execution
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
Luc Bouganim, Olga Kapitskaia, Patrick Valduriez