Sciweavers

4277 search results - page 95 / 856
» On Multiple Linear Approximations
Sort
View
ICTCS
2003
Springer
15 years 3 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
CSL
2002
Springer
14 years 10 months ago
Classical Linear Logic of Implications
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...
Masahito Hasegawa
CORR
2002
Springer
102views Education» more  CORR 2002»
14 years 10 months ago
Tight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young
NIPS
2001
14 years 11 months ago
Rates of Convergence of Performance Gradient Estimates Using Function Approximation and Bias in Reinforcement Learning
We address two open theoretical questions in Policy Gradient Reinforcement Learning. The first concerns the efficacy of using function approximation to represent the state action ...
Gregory Z. Grudic, Lyle H. Ungar
MOC
1998
95views more  MOC 1998»
14 years 9 months ago
The Trotter-Kato theorem and approximation of PDEs
Abstract. We present formulations of the Trotter-Kato theorem for approximation of linear C0-semigroups which provide very useful framework when convergence of numerical approximat...
Kazufumi Ito, Franz Kappel