2084 search results - page 396 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
88
Voted
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...
ISPD
2000
ACM
15 years 2 months ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
SUTC
2010
IEEE
15 years 1 months ago
2010
IEEE
—In distributed sensor networks, computational and energy resources are in general limited. Therefore, an intelligent selection of sensors for measurements is of great importance...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
ESWA
2006
14 years 9 months ago
2006
In the past, the selection of resources to execute various warehouse operation services was done solely by experts. In this paper, a RFIDbased Resource Management System (RFID-RMS...