1265 search results - page 187 / 253 » Randomized Algorithms and Probabilistic Analysis in Wireless... |
ML
1998
ACM
13 years 8 months ago
1998
ACM
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optim...
PERCOM
2006
ACM
14 years 8 months ago
2006
ACM
Tiny embedded systems have not been an ideal outfit for high performance computing due to their constrained resources. Limitations in processing power, battery life, communication ...
DC
2010
13 years 9 months ago
2010
Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...
MOBIHOC
2003
ACM
14 years 8 months ago
2003
ACM
It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. W...
AI
2002
Springer
13 years 8 months ago
2002
Springer
This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop e...