1510 search results - page 202 / 302 » Upper Probabilities and Additivity |
138
click to vote
RTSS
2005
IEEE
15 years 10 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
120
click to vote
SENSYS
2005
ACM
15 years 10 months ago
2005
ACM
This paper presents the Simple Packet Combining (SPaC) error-correction scheme for wireless sensor networks. Nodes buffer corrupt packets, and when two or more corrupt versions o...
128
click to vote
GD
2005
Springer
15 years 10 months ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
142
click to vote
MSWIM
2004
ACM
15 years 9 months ago
2004
ACM
Discrete event network simulators have emerged as popular tools for verification and performance evaluation for various wireless networks. Nevertheless, the desire to model such ...
140
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...