Sciweavers

103 search results - page 18 / 21
» Approximating rooted Steiner networks
Sort
View
STACS
2001
Springer
14 years 2 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
IPPS
1998
IEEE
14 years 2 months ago
Multicasting and Broadcasting in Large WDM Networks
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
Weifa Liang, Hong Shen
SIAMADS
2010
145views more  SIAMADS 2010»
13 years 5 months ago
Propagation of Spike Sequences in Neural Networks
Precise spatiotemporal sequences of action potentials are observed in many brain areas and are thought to be involved in the neural processing of sensory stimuli. Here, we examine ...
Arnaud Tonnelier
OPODIS
2004
13 years 11 months ago
Searching for a Black Hole in Tree Networks
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
INFOCOM
2008
IEEE
14 years 4 months ago
Cross-Monotonic Multicast
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...
Zongpeng Li