Sciweavers

587 search results - page 48 / 118
» There is No Such Thing as Free Support
Sort
View
SRDS
2000
IEEE
14 years 1 months ago
Detection of Livelocks in Communication Protocols by Means of a Polygon Time Structure
As has been shown, the polygon time structure overcomes the main limitations of the interval time structure, and allows to verify communication protocols, in which the explicit co...
Jerzy Brzezinski, Michal Sajkowski
CN
1999
88views more  CN 1999»
13 years 8 months ago
Building a high-performance, programmable secure coprocessor
Secure coprocessors enable secure distributed applications by providing safe havens where an application program can Z .execute and accumulate state , free of observation and inte...
Sean W. Smith, Steve Weingart
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
14 years 19 days ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
ATAL
2006
Springer
14 years 14 days ago
Failures of the VCG mechanism in combinatorial auctions and exchanges
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
Vincent Conitzer, Tuomas Sandholm
CIDR
2007
141views Algorithms» more  CIDR 2007»
13 years 10 months ago
Fragmentation in Large Object Repositories
Fragmentation leads to unpredictable and degraded application performance. While these problems have been studied in detail for desktop filesystem workloads, this study examines n...
Russell Sears, Catharine van Ingen