Sciweavers

1974 search results - page 41 / 395
» On Unbiased Linear Approximations
Sort
View
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
14 years 4 months ago
Adaptive bases for Q-learning
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...
Dotan Di Castro, Shie Mannor
COCOON
2005
Springer
15 years 3 months ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
ICISC
2008
146views Cryptology» more  ICISC 2008»
14 years 11 months ago
A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent
Abstract. In this paper, we present a new technique for Matsui's algorithm 2 using multidimensional linear approximation. We show that the data complexity of the attack can be...
Joo Yeon Cho, Miia Hermelin, Kaisa Nyberg
CIE
2005
Springer
14 years 11 months ago
Domain-Theoretic Formulation of Linear Boundary Value Problems
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
Dirk Pattinson
SODA
2012
ACM
185views Algorithms» more  SODA 2012»
13 years 4 days ago
On a linear program for minimum-weight triangulation
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
Arman Yousefi, Neal E. Young