Sciweavers

4744 search results - page 278 / 949
» Connected Computing
Sort
View
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
15 years 9 months ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...
SPAA
2003
ACM
15 years 9 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
NEUROSCIENCE
2001
Springer
15 years 8 months ago
Locust Olfaction
During odour recognition, excitatory and inhibitory groups of neurons in the second stage of the locust olfactory system, the antennal lobe (AL), fire alternately. There is little...
David C. Sterratt
144
Voted
CCR
2006
118views more  CCR 2006»
15 years 4 months ago
Tmix: a tool for generating realistic TCP application workloads in ns-2
In order to perform realistic network simulations, one needs a traffic generator that is capable of generating realistic synthetic traffic in a closed-loop fashion that "look...
Michele C. Weigle, Prashanth Adurthi, Félix...
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
15 years 2 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport