Sciweavers

5158 search results - page 66 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
AAAI
2008
13 years 11 months ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
13 years 10 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...
AGI
2008
13 years 10 months ago
OSCAR: An Architecture for Generally Intelligent Agents
OSCAR is a fully implemented architecture for a cognitive agent, based largely on the author's work in philosophy concerning epistemology and practical cognition. The seminal ...
John L. Pollock
AIML
2006
13 years 10 months ago
A General Semantics for Quantified Modal Logic
In [9] we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complet...
Robert Goldblatt, Edwin D. Mares
PC
2006
103views Management» more  PC 2006»
13 years 8 months ago
Parallel skeletons for manipulating general trees
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi