511 search results - page 37 / 103 » Analysis of Multi-Organization Scheduling Algorithms |
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...
103
click to vote
LCN
2005
IEEE
15 years 3 months ago
2005
IEEE
— The problem of achieving fairness in the allocation of the bandwidth resource on a link shared by multiple flows of traffic has been extensively researched over the last deca...
114
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—In this paper, we investigate and analyze the expected per-node throughput in a wireless sensor network under a randomized sleep scheduling framework with a connectivity...
SPIN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
78
Voted
SIGCOMM
2004
ACM
15 years 3 months ago
2004
ACM
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...