Sciweavers

180 search results - page 32 / 36
» Measure on P: Robustness of the Notion
Sort
View
JAIR
2000
123views more  JAIR 2000»
13 years 7 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
SIGCOMM
2004
ACM
14 years 26 days ago
A wavelet-based approach to detect shared congestion
Per-flow congestion control helps endpoints fairly and efficiently share network resources. Better utilization of network resources can be achieved, however, if congestion manag...
Min Sik Kim, Taekhyun Kim, YongJune Shin, Simon S....
CONEXT
2009
ACM
13 years 8 months ago
The age of impatience: optimal replication schemes for opportunistic networks
: We study mobile P2P content dissemination schemes which leverage the local dedicated caches provided by hand-held devices (e.g., smart-phones, PDAs) and opportunistic contacts be...
Joshua Reich, Augustin Chaintreau
BMCBI
2010
124views more  BMCBI 2010»
13 years 7 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...
JSAC
2007
128views more  JSAC 2007»
13 years 7 months ago
Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?
— Most of the real deployed peer-to-peer streaming systems adopt pull-based streaming protocol. In this paper, we demonstrate that, besides simplicity and robustness, with proper...
Meng Zhang, Qian Zhang, Lifeng Sun, Shiqiang Yang