2252 search results - page 354 / 451 » Lower Bounds for Dynamic Algorithms |
126
click to vote
PODC
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
130
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
116
Voted
ICCAD
2010
IEEE
14 years 11 months ago
2010
IEEE
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
113
click to vote
IPSN
2004
Springer
15 years 7 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
101
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
The performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple...