1729 search results - page 301 / 346 » Bound Graph Polysemy |
146
Voted
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
129
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
—Geographic routing protocols like GOAFR or GPSR rely on exact location information at the nodes, because when the greedy routing phase gets stuck at a local minimum, they requir...
132
click to vote
IPCCC
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
106
click to vote
ROBOCOMM
2007
IEEE
15 years 11 months ago
2007
IEEE
— The objective of this paper is decentralized swarm aggregation with collision avoidance. Specifically, each agent is assigned with a control law which is the sum of two elemen...
119
click to vote
ESA
2007
Springer
15 years 11 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...