Sciweavers

2233 search results - page 210 / 447
» On the Complexity of Theory Curbing
Sort
View
TPHOL
2002
IEEE
15 years 11 months ago
Type-Theoretic Functional Semantics
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
Yves Bertot, Venanzio Capretta, Kuntal Das Barman
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
15 years 11 months ago
PODS: a new model and processing algorithms for uncertain data streams
Uncertain data streams, where data is incomplete, imprecise, and even misleading, have been observed in many environments. Feeding such data streams to existing stream systems pro...
Thanh T. L. Tran, Liping Peng, Boduo Li, Yanlei Di...
ALT
2001
Springer
15 years 11 months ago
Learning Coherent Concepts
We develop a theory for learning scenarios where multiple learners co-exist but there are mutual compatibility constraints on their outcomes. This is natural in cognitive learning...
Ashutosh Garg, Dan Roth
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 11 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic