11345 search results - page 1751 / 2269 » Foundations of Computer Science |
160
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
100
click to vote
ICS
2010
Tsinghua U.
16 years 2 months ago
2010
Tsinghua U.
feuse of its devstting eets in utions nd other mehnismsD ollusion is prohiited nd leglly proseutedF etD olluders hve lwys existedD nd my ontinue to existF e thus rise the followin...
143
click to vote
STACS
2010
Springer
16 years 2 days ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
145
click to vote
ACSC
2009
IEEE
15 years 12 months ago
2009
IEEE
Recent research indicates that modern computer workloads (e.g. processing time of web requests) follow heavy-tailed distributions. In a heavy-tailed distribution there are a large...
149
click to vote
CSE
2009
IEEE
15 years 12 months ago
2009
IEEE
Abstract—Today’s wirelessly networked embedded systems underlie a vast array of electronic devices, performing computation, communication, and input/output. A major design goal...