Sciweavers

5608 search results - page 36 / 1122
» On the Theory of Matchgate Computations
Sort
View
CADE
2009
Springer
16 years 2 months ago
Computing Knowledge in Security Protocols under Convergent Equational Theories
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
Stéphanie Delaune, Stefan Ciobâca, St...
ACE
2004
162views Education» more  ACE 2004»
15 years 2 months ago
Computing Theory With Relevance
In computer science education, the topic of computing theory is one that is commonly not well received by students. Career-oriented students often view the topic as irrelevant, an...
Wayne Brookes
ANOR
2008
127views more  ANOR 2008»
15 years 1 months ago
Computer science and decision theory
This paper reviews applications in computer science that decision theorists have addressed for years, discusses the requirements posed by these applications that place great strai...
Fred S. Roberts
CSE
2009
IEEE
15 years 4 months ago
Extended Dempster-Shafer Theory in Context Reasoning for Ubiquitous Computing Environments
—Context, the pieces of information that capture the characteristics of ubiquitous computing environment, is often imprecise and incomplete due to user mobility, unreliable wirel...
Daqiang Zhang, Jiannong Cao, Jingyu Zhou, Minyi Gu...
LICS
2002
IEEE
15 years 6 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson