204 search results - page 38 / 41 » On Constrained Minimum Pseudotriangulations |
ICCNMC
2005
Springer
14 years 1 months ago
2005
Springer
— In this paper, we address a sensor network lifetime problem that maintains a certain throughput in an environment where physical node destruction is possible. While lifetime is...
WINE
2005
Springer
14 years 1 months ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
INFOCOM
2003
IEEE
14 years 28 days ago
2003
IEEE
— In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the b...
INFOCOM
2002
IEEE
14 years 18 days ago
2002
IEEE
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
FOCS
1997
IEEE
13 years 12 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...