Sciweavers

8196 search results - page 1415 / 1640
» Computational Modeling and Complexity Science
Sort
View
IPMU
1992
Springer
15 years 8 months ago
Rule-Based Systems with Unreliable Conditions
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...
L. Cardona, Jürg Kohlas, Paul-André Mo...
AUTONOMICS
2007
ACM
15 years 8 months ago
Adaptive learning of semantic locations and routes
Abstract. Adaptation of devices and applications based on contextual information has a great potential to enhance usability and mitigate the increasing complexity of mobile devices...
Keshu Zhang, Haifeng Li, Kari Torkkola, Mike Gardn...
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
15 years 8 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
15 years 6 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...
AAAI
2006
15 years 5 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
« Prev « First page 1415 / 1640 Last » Next »