Sciweavers

846 search results - page 18 / 170
» The Use of Z
Sort
View
JSC
2006
102views more  JSC 2006»
13 years 7 months ago
Counterexamples to witness conjectures
Consider the class of exp-log constants, which is constructed from the integers using the field operations, exponentiation and logarithm. Let z be such an exp-log constant and let...
Joris van der Hoeven
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...
NIPS
2001
13 years 9 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
DCC
2008
IEEE
14 years 7 months ago
New negative Latin square type partial difference sets in nonelementary abelian 2-groups and 3-groups
A partial difference set having parameters (n2, r(n - 1), n + r2 - 3r, r2 - r) is called a Latin square type partial difference set, while a partial difference set having paramete...
John B. Polhill
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
14 years 1 months ago
Equivalence verification of arithmetic datapaths with multiple word-length operands
Abstract: This paper addresses the problem of equivalence verification of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have di...
Namrata Shekhar, Priyank Kalla, Florian Enescu