9842 search results - page 1498 / 1969 » Problem complexity |
194
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
220
click to vote
EUROSYS
2010
ACM
16 years 4 months ago
2010
ACM
The benefits of virtualized IT environments, such as compute clouds, have drawn interested enterprises to migrate their applications onto new platforms to gain the advantages of ...
203
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
Pointer bugs associated with dynamically-allocated objects resulting in out-of-bounds memory access are an important class of software bugs. Because such bugs cannot be detected e...
183
click to vote
ICPP
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—As Chip-Multiprocessor systems (CMP) have become the predominant topology for leading microprocessors, critical components of the system are now integrated on a single c...
214
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...