2808 search results - page 489 / 562 » Routing betweenness centrality |
100
click to vote
MP
1998
14 years 10 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
117
click to vote
WIOPT
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract—The cross-layer utility maximization problem subject to stability constraints is considered for a multi-hop wireless network. A time slotted network, where the channel g...
127
click to vote
ANTSW
2010
Springer
14 years 9 months ago
2010
Springer
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...
GLOBECOM
2010
IEEE
14 years 9 months ago
2010
IEEE
A mix is a communication proxy that hides the relationship between incoming and outgoing messages. Routing traffic through a path of mixes is a powerful tool for providing privacy....
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...