Sciweavers

36 search results - page 6 / 8
» Confluence Reduction for Probabilistic Systems (extended ver...
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
13 years 2 months ago
Universal scheduling for networks with arbitrary traffic, channels, and mobility
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
Michael J. Neely
ENTCS
2006
140views more  ENTCS 2006»
13 years 7 months ago
Stochastic Ambient Calculus
Mobile Ambients (MA) have acquired a fundamental role in modelling mobility in systems with mobile code and mobile devices, and in computation over administrative domains. We pres...
Maria Grazia Vigliotti, Peter G. Harrison
INFOCOM
2009
IEEE
14 years 2 months ago
apt-p2p: A Peer-to-Peer Distribution System for Software Package Releases and Updates
—The Internet has become a cost-effective vehicle for software development and release, particular in the free software community. Given the free nature of this software, there a...
Cameron Dale, Jiangchuan Liu
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
13 years 11 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl