Sciweavers

1942 search results - page 345 / 389
» HINT: A new way to measure computer performance
Sort
View
IMC
2006
ACM
15 years 5 months ago
Rarest first and choke algorithms are enough
The performance of peer-to-peer file replication comes from its piece and peer selection strategies. Two such strategies have been introduced by the BitTorrent protocol: the rare...
Arnaud Legout, Guillaume Urvoy-Keller, Pietro Mich...
BMCBI
2006
108views more  BMCBI 2006»
14 years 12 months ago
Probe set algorithms: is there a rational best bet?
Affymetrix microarrays have become a standard experimental platform for studies of mRNA expression profiling. Their success is due, in part, to the multiple oligonucleotide featur...
Jinwook Seo, Eric P. Hoffman
VEE
2006
ACM
115views Virtualization» more  VEE 2006»
15 years 5 months ago
Live updating operating systems using virtualization
Many critical IT infrastructures require non-disruptive operations. However, the operating systems thereon are far from perfect that patches and upgrades are frequently applied, i...
Haibo Chen, Rong Chen, Fengzhe Zhang, Binyu Zang, ...
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
15 years 4 months ago
Event-based control using quadratic approximate value functions
Abstract— In this paper we consider several problems involving control with limited actuation and sampling rates. Event-based control has emerged as an attractive approach for ad...
Randy Cogill
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 3 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts