Sciweavers

6939 search results - page 1388 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
FCT
2009
Springer
13 years 11 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
CN
2011
176views more  CN 2011»
12 years 8 months ago
Taming the elephants: New TCP slow start
Standard slow start does not work well under large bandwidthdelay product (BDP) networks. We find two causes of this problem in existing three popular operating systems, Linux, F...
Sangtae Ha, Injong Rhee
EUROSYS
2006
ACM
14 years 1 months ago
Experiences in building and operating ePOST, a reliable peer-to-peer application
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
Alan Mislove, Ansley Post, Andreas Haeberlen, Pete...
FSTTCS
2009
Springer
13 years 11 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
« Prev « First page 1388 / 1388 Last » Next »