1561 search results - page 269 / 313 » Probability Theory on IF Events |
SIGCOMM
2005
ACM
15 years 3 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
SIGMETRICS
2005
ACM
15 years 3 months ago
2005
ACM
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
SIGMETRICS
2005
ACM
15 years 3 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
COCOON
2003
Springer
15 years 3 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...