Sciweavers

358 search results - page 11 / 72
» GCD of Many Integers
Sort
View
MOC
1998
65views more  MOC 1998»
13 years 7 months ago
Solving constrained Pell equations
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
Kiran S. Kedlaya
DAC
2006
ACM
14 years 8 months ago
Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
Eduardo A. C. da Costa, José Monteiro, Leve...
DAGSTUHL
2008
13 years 9 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
IADIS
2003
13 years 8 months ago
Data Extraction from Web Database Query Result Pages via Tagsets and Integer Sequences
The World Wide Web is a collection of databases as well as web sites. Databases associated with web sites provide public access via query forms on web pages. They constitute an en...
Jerome Robinson
IPPS
2006
IEEE
14 years 1 months ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...