Sciweavers

914 search results - page 16 / 183
» Branch and Bound on the Network Model
Sort
View
CNSR
2007
IEEE
158views Communications» more  CNSR 2007»
13 years 9 months ago
Bounding the Information Collection Performance of Wireless Sensor Network Routing
Wireless sensor networks have mainly been designed for information-collecting purposes, such as habitat monitoring, product process tracing, battlefield surveillance, etc. In orde...
Qinghua Wang, Tingting Zhang, Stefan Pettersson
IJON
2007
99views more  IJON 2007»
13 years 7 months ago
Criticality of avalanche dynamics in adaptive recurrent networks
In many studies of self-organized criticality (SOC), branching processes were used to model the dynamics of the activity of the system during avalanches. This mathematical simpliï...
Anna Levina, Udo Ernst, J. Michael Herrmann
APPML
2007
154views more  APPML 2007»
13 years 7 months ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio
ADHOCNOW
2008
Springer
13 years 8 months ago
A Lower Bound on the Capacity of Wireless Ad Hoc Networks with Cooperating Nodes
In this paper, we consider the effects on network capacity when the nodes of an ad hoc network are allowed to cooperate. These results are then compared to the theoretical upper b...
Anthony S. Acampora, Louisa Pui Sum Ip
GECCO
2007
Springer
144views Optimization» more  GECCO 2007»
13 years 11 months ago
Multiobjective network design for realistic traffic models
Network topology design problems find application in several real life scenarios. However, most designs in the past either optimize for a single criterion like delay or assume sim...
Nilanjan Banerjee, Rajeev Kumar