Sciweavers

86 search results - page 4 / 18
» Timed Diagnostics for Reachability Properties
Sort
View
NIPS
2007
13 years 9 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
KR
2000
Springer
13 years 11 months ago
Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
Alan Verberne, Frank van Harmelen, Annette ten Tei...
ISAAC
2001
Springer
87views Algorithms» more  ISAAC 2001»
14 years 3 days ago
On Removing the Pushdown Stack in Reachability Constructions
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton...
Oscar H. Ibarra, Zhe Dang
CCECE
2009
IEEE
14 years 2 months ago
Inverse data transformation for change detection in wind turbine diagnostics
A complex system is expected to show different nominal behaviors under different conditions, and the deviation over time from these nominal behaviors is an indicator of potential ...
Yanjun Yan, Lisa Ann Osadciw, Glen Benson, Eric Wh...
JAR
2006
97views more  JAR 2006»
13 years 7 months ago
Decidability Issues for Extended Ping-Pong Protocols
We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we sho...
Hans Hüttel, Jirí Srba