Sciweavers

3082 search results - page 44 / 617
» New Bounds for the Controller Problem
Sort
View
111
Voted
COLT
2000
Springer
15 years 8 months ago
Estimation and Approximation Bounds for Gradient-Based Reinforcement Learning
We model reinforcement learning as the problem of learning to control a Partially Observable Markov Decision Process (  ¢¡¤£¦¥§  ), and focus on gradient ascent approache...
Peter L. Bartlett, Jonathan Baxter
111
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
A new TCP/AQM for Stable Operation in Fast Networks
—This paper is aimed at designing a congestion control system that scales gracefully with network capacity, providing high utilization, low queueing delay, dynamic stability, and...
Fernando Paganini, Zhikui Wang, Steven H. Low, Joh...
146
Voted
AAAI
2006
15 years 5 months ago
A New Approach to Distributed Task Assignment using Lagrangian Decomposition and Distributed Constraint Satisfaction
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
Katsutoshi Hirayama
137
Voted
TCS
2010
15 years 2 months ago
CSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
Catarina Carvalho, Víctor Dalmau, Andrei A....
144
Voted
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 1 months ago
Differential Privacy in New Settings
Differential privacy is a recent notion of privacy tailored to the problem of statistical disclosure control: how to release statistical information about a set of people without ...
Cynthia Dwork