Sciweavers

6506 search results - page 863 / 1302
» Algorithmic models for sensor networks
Sort
View
CDC
2008
IEEE
15 years 11 months ago
On stability in the presence of analog erasure channels
— Consider a discrete-time networked control scheme, in which the controller has direct access to noisy measurements of the plant’s output, but the controller and the actuator ...
Vijay Gupta, Nuno C. Martins
ICMCS
2005
IEEE
92views Multimedia» more  ICMCS 2005»
15 years 10 months ago
Personalized Prefetching for Manets
Mobile ad hoc networks (MANETs) are a very promising next generation networks. Prediction is an essential aspect in the deployment of MANETs. Current work mainly focuses on mobili...
S. H. Srinivasan
IFIPTCS
2010
15 years 2 months ago
A Game-Theoretic Approach to Routing under Adversarial Conditions
Abstract. We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termi...
James Gross, Frank G. Radmacher, Wolfgang Thomas
JMLR
2000
134views more  JMLR 2000»
15 years 4 months ago
Learning with Mixtures of Trees
This paper describes the mixtures-of-trees model, a probabilistic model for discrete multidimensional domains. Mixtures-of-trees generalize the probabilistic trees of Chow and Liu...
Marina Meila, Michael I. Jordan
TCS
1998
15 years 4 months ago
ERCW PRAMs and Optical Communication
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
Philip D. MacKenzie, Vijaya Ramachandran