9997 search results - page 168 / 2000 » The case for crowd computing |
103
click to vote
TRIDENTCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
- Rendezvous among experiment entities appear in network experiments both implicitly and explicitly. When the driving system for a network experiment testbed supports such rendezvo...
111
click to vote
LCN
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper presents a model for the expected throughput in a Bluetooth network in presence of a number of other Bluetooth networks that cause radio interference. The analysis cons...
155
click to vote
COCO
1995
Springer
15 years 8 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
230
click to vote
PC
2011
14 years 11 months ago
2011
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
151
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
The era of parallel computing for the masses is here, but writing correct parallel programs remains far more difficult than writing sequential programs. Aside from a few domains,...