Sciweavers

5158 search results - page 133 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
IJCAI
1989
13 years 11 months ago
Detecting and Correcting Errors of Omission After Explanation-Based Learning
In this paper, we address an issue that arises when the background knowledge used by explanationbased learning is incorrect. In particular, we consider the problems that can be ca...
Michael J. Pazzani
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 10 months ago
Geometry and the complexity of matrix multiplication
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
J. M. Landsberg
ICFP
2005
ACM
14 years 10 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
ACL
2012
12 years 16 days ago
Humor as Circuits in Semantic Networks
This work presents a first step to a general implementation of the Semantic-Script Theory of Humor (SSTH). Of the scarce amount of research in computational humor, no research ha...
Igor Labutov, Hod Lipson
SIGECOM
2006
ACM
107views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Networks preserving evolutionary equilibria and the power of randomization
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...
Michael S. Kearns, Siddharth Suri