Sciweavers

698 search results - page 35 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
ECML
2007
Springer
14 years 3 months ago
Safe Q-Learning on Complete History Spaces
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observat...
Stephan Timmer, Martin Riedmiller
SIGMOD
2008
ACM
122views Database» more  SIGMOD 2008»
13 years 9 months ago
UQBE: uncertain query by example for web service mashup
The UQBE is a mashup tool for non-programmers that supports query-by-example (QBE) over a schema made up by the user without knowing the schema of the original sources. Based on a...
Jun'ichi Tatemura, Songting Chen, Fenglin Liao, Ol...
ATAL
2003
Springer
14 years 2 months ago
Transition-independent decentralized markov decision processes
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
FOCS
1991
IEEE
14 years 25 days ago
A parallel algorithmic version of the Local Lemma
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
Noga Alon
SSPR
1998
Springer
14 years 1 months ago
A Statistical Clustering Model and Algorithm
In this paper, a statistical clustering model and algorithm have been discussed. Finding the optimal solution to clustering problem is transformed into simulating the equilibrium ...
Guangwen Yang, Weimin Zheng, Dingxing Wang