Sciweavers

1080 search results - page 53 / 216
» The Complexity of Belief Update
Sort
View
UAI
2000
15 years 7 months ago
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...
Michael C. Horsch, William S. Havens
NIPS
2008
15 years 7 months ago
Adapting to a Market Shock: Optimal Sequential Market-Making
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...
Sanmay Das, Malik Magdon-Ismail
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 6 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
IJCAI
1993
15 years 7 months ago
A Metalogic Programming Approach to Reasoning about Time in Knowledge Bases
The problem of representing and reasoning about two notions of time that are relevant in the context of knowledge bases is addressed. These are called historical time and belief t...
Suryanarayana M. Sripada
IJAR
2008
167views more  IJAR 2008»
15 years 6 months ago
Approximate algorithms for credal networks with binary variables
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman