Sciweavers

854 search results - page 26 / 171
» Abstracting from Failure Probabilities
Sort
View
EPIA
1995
Springer
15 years 9 months ago
Using Stochastic Grammars to Learn Robotic Tasks
Abstract. The paper introduces a reinforcement learning-based methodology for performance improvement of Intelligent Controllers. The translation interfaces of a 3-level Hierarchic...
Pedro U. Lima, George N. Saridis
TSP
2008
167views more  TSP 2008»
15 years 5 months ago
Decentralized Adaptive Filtering Algorithms for Sensor Activation in an Unattended Ground Sensor Network
Abstract--We present decentralized adaptive filtering algorithms for sensor activation control in an unattended ground sensor network (UGSN) comprised of ZigBee-enabled nodes. Node...
Vikram Krishnamurthy, Michael Maskery, Gang George...
JOT
2010
108views more  JOT 2010»
15 years 4 months ago
Dynamic adaptability with .NET service components
In self-adaptive systems components are dynamically modified according to the execution environment requirement, where each component is a probable point of failure. Existing appr...
Arun Mishra, A. K. Misra
USITS
2001
15 years 7 months ago
End-to-End WAN Service Availability
Abstract--This paper seeks to understand how network failures affect the availability of service delivery across wide-area networks (WANs) and to evaluate classes of techniques for...
Bharat Chandra, Michael Dahlin, Lei Gao, Amol Naya...
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
15 years 10 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro