Sciweavers

5084 search results - page 199 / 1017
» Proving Possibility Properties
Sort
View
ICML
2006
IEEE
16 years 7 months ago
PAC model-free reinforcement learning
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
Alexander L. Strehl, Lihong Li, Eric Wiewiora, Joh...
ICASSP
2009
IEEE
16 years 1 months ago
A simple, efficient and near optimal algorithm for compressed sensing
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well ...
Thomas Blumensath, Mike E. Davies
LICS
2008
IEEE
16 years 24 days ago
Cut Elimination for Monomial MALL Proof Nets
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
Olivier Laurent, Roberto Maieli
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
15 years 11 months ago
Overcoming limitations of game-theoretic distributed control
—Recently, game theory has been proposed as a tool for cooperative control. Specifically, the interactions of a multiagent distributed system are modeled as a non-cooperative ga...
Jason R. Marden, Adam Wierman
CATS
2008
15 years 7 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...