Sciweavers

828 search results - page 88 / 166
» Bounded Hairpin Completion
Sort
View
DATE
2006
IEEE
145views Hardware» more  DATE 2006»
14 years 4 months ago
Improved offset-analysis using multiple timing-references
In this paper, we present an extension to existing approaches that capture and exploit timing-correlation between tasks for scheduling analysis in distributed systems. Previous ap...
Rafik Henia, Rolf Ernst
FOCS
2006
IEEE
14 years 4 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
ARITH
2005
IEEE
14 years 3 months ago
Arithmetic Operations in the Polynomial Modular Number System
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
Jean-Claude Bajard, Laurent Imbert, Thomas Plantar...
DGCI
2005
Springer
14 years 3 months ago
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
SAS
2005
Springer
14 years 3 months ago
A Generic Framework for Interprocedural Analysis of Numerical Properties
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
Markus Müller-Olm, Helmut Seidl