Sciweavers

1974 search results - page 23 / 395
» On Unbiased Linear Approximations
Sort
View
AIPS
2008
14 years 12 months ago
Learning Heuristic Functions through Approximate Linear Programming
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
Marek Petrik, Shlomo Zilberstein
SIAMSC
2008
193views more  SIAMSC 2008»
14 years 9 months ago
Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
Sadegh Jokar, Marc E. Pfetsch
SIAMNUM
2010
140views more  SIAMNUM 2010»
14 years 4 months ago
Finite Element Approximation of the Linear Stochastic Wave Equation with Additive Noise
Semidiscrete finite element approximation of the linear stochastic wave equation with additive noise is studied in a semigroup framework. Optimal error estimates for the determinis...
Mihály Kovács, Stig Larsson, Fardin ...
CRYPTO
1994
Springer
128views Cryptology» more  CRYPTO 1994»
15 years 1 months ago
Linear Cryptanalysis Using Multiple Approximations
We present a technique which aids in the linear cryptanalysis of a block cipher and allows for a reduction in the amount of data required for a successful attack. We note the limit...
Burton S. Kaliski Jr., Matthew J. B. Robshaw
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
15 years 3 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
Matthias Müller-Hannemann, Siamak Tazari