709 search results - page 6 / 142 » On LR(k)-Parsers of Polynomial Size |
ICCAD
2005
IEEE
15 years 6 months ago
2005
IEEE
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
DSD
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper focuses on numerical function generators (NFGs) based on k-th order polynomial approximations. We show that increasing the polynomial order k reduces significantly the...
ORL
2007
14 years 9 months ago
2007
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one ...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...