Sciweavers

321 search results - page 46 / 65
» Approximate Models for General Cache Networks
Sort
View
MOBICOM
2004
ACM
14 years 1 months ago
Using code collection to support large applications on mobile devices
The progress of mobile device technology unfolds a new spectrum of applications that challenges conventional infrastructure models. Most of these devices are perceived by their us...
Lucian Popa 0002, Irina Athanasiu, Costin Raiciu, ...
MOBIHOC
2009
ACM
14 years 9 months ago
Characterizing the exit process of a non-saturated IEEE 802.11 wireless network
In this paper, we consider a non-saturated IEEE 802.11 based wireless network. We use a three-way fixed point to model the node behavior with Bernoulli packet arrivals and determi...
Punit Rathod, Onkar Dabeer, Abhay Karandikar, Anir...
ATAL
2007
Springer
14 years 2 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
IJON
2007
120views more  IJON 2007»
13 years 8 months ago
Comparison of dynamical states of random networks with human EEG
Existing models of EEG have mainly focused on relations to network dynamics characterized by firing rates [L. de Arcangelis, H.J. Herrmann, C. Perrone-Capano, Activity-dependent ...
Ralph Meier, Arvind Kumar, Andreas Schulze-Bonhage...
INFOCOM
2008
IEEE
14 years 2 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...