Sciweavers

1805 search results - page 113 / 361
» A Theory of Closure Operators
Sort
View
117
Voted
AUTOMATICA
2007
70views more  AUTOMATICA 2007»
15 years 4 months ago
On detectability of stochastic systems
We discuss notions of detectability for stochastic linear control systems of Itˆo type. A natural concept of detectability requires a non-zero output, if the state process is uns...
Tobias Damm
ICALP
2001
Springer
15 years 9 months ago
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
Furio Honsell, Marino Miculan, Ivan Scagnetto
ACTA
2004
86views more  ACTA 2004»
15 years 4 months ago
Specification transformers: a predicate transformer approach to composition
Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and ...
Michel Charpentier, K. Mani Chandy
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
15 years 10 months ago
Information landscapes and the analysis of search algorithms
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
Yossi Borenstein, Riccardo Poli
127
Voted
FSKD
2008
Springer
113views Fuzzy Logic» more  FSKD 2008»
15 years 5 months ago
Incremental Knowledge Base for Uncertain Reasoning
Evidence theory has been widely applied to uncertain reasoning. However, the evidence space and hypothesis space are each defined as a fixed set. If the theory is applied to solve...
Qingxiang Wu, Xi Huang, David A. Bell, Guilin Qi, ...