1414 search results - page 106 / 283 » Cover Time and Broadcast Time |
SAT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
P2P
2010
IEEE
14 years 8 months ago
2010
IEEE
—Internet Service Providers (ISPs) have failed to reduce the cost of peer-to-peer (P2P) traffic. Traffic throttling devices increase user download times, and caches store content...
89
Voted
SPAA
1993
ACM
15 years 2 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
69
Voted
EUROPAR
2007
Springer
15 years 4 months ago
2007
Springer
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
ETT
2000
14 years 10 months ago
2000
This paper considers all-optical broadcast networks providing a number of slotted WDM channels for packet communications. Each network user is equipped with one tunable transmitter...