Sciweavers

540 search results - page 80 / 108
» Competitive Routing over Time
Sort
View
CCS
2011
ACM
12 years 10 months ago
Forensic investigation of the OneSwarm anonymous filesharing system
OneSwarm is a system for anonymous p2p file sharing in use by thousands of peers. It aims to provide Onion Routing-like privacy and BitTorrent-like performance. We demonstrate se...
Swagatika Prusty, Brian Neil Levine, Marc Liberato...
HICSS
2006
IEEE
98views Biometrics» more  HICSS 2006»
14 years 4 months ago
Electricity Markets: How Many, Where and When?
Most markets compromise the economist’s ideal of matching the marginal benefits to consumers with the marginal cost of supply for incremental purchases because individual buyers...
Nodir Adilov, Richard E. Schuler
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 6 months ago
AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming
Abstract--Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often ...
Andréa W. Richa, Christian Scheideler, Stef...
STOC
1999
ACM
106views Algorithms» more  STOC 1999»
14 years 2 months ago
Scheduling in the Dark
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
Jeff Edmonds
AAAI
2012
12 years 15 days ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...